On the strong beta-number of galaxies with three and four components
The beta-number of a graph is the smallest positive integer for which there exists an injective function such that each is labeled and the resulting set of edge labels is for some positive integer . The beta-number of is if there exists no such integer . If , then the resulting beta-number is called...
Main Authors: | Rikio Ichishima, Francesc A. Muntaner-Batle, Akito Oshima |
---|---|
Format: | Article |
Language: | English |
Published: |
Taylor & Francis Group
2020-01-01
|
Series: | AKCE International Journal of Graphs and Combinatorics |
Subjects: | |
Online Access: | http://dx.doi.org/10.1016/j.akcej.2019.03.004 |
Similar Items
-
On the beta-number of linear forests with an even number of components
by: Rikio Ichishima, et al.
Published: (2018-12-01) -
On the Beta-Number of Forests with Isomorphic Components
by: Ichishima Rikio, et al.
Published: (2018-08-01) -
The consecutively super edge-magic deficiency of graphs and related concepts
by: Rikio Ichishima, et al.
Published: (2020-04-01) -
On the strength of some trees
by: Rikio Ichishima, et al.
Published: (2020-01-01) -
Exclusive graphs: a new link among labelings
by: Rikio Ichishima, et al.
Published: (2019-06-01)