On the Beta-Number of Forests with Isomorphic Components

The beta-number, β (G), of a graph G is defined to be either the smallest positive integer n for which there exists an injective function f : V (G) → {0, 1, . . . , n} such that each uv ∈ E (G) is labeled |f (u) − f (v)| and the resulting set of edge labels is {c, c + 1, . . . , c + |E (G)| − 1} for...

Full description

Bibliographic Details
Main Authors: Ichishima Rikio, López Susana-Clara, Muntaner-Batle Francesc Antoni, Oshima Akito
Format: Article
Language:English
Published: University of Zielona Góra 2018-08-01
Series:Discussiones Mathematicae Graph Theory
Subjects:
Online Access:https://doi.org/10.7151/dmgt.2033