No Detail Found!

On the beta-number and gamma-number of galaxies

Author(s)
Rikio Ichishima Department of Sport and Physical Education, Faculty of Physical Education, Kokushikan University, 7-3-1 Nagayama, Tama-shi, Tokyo 206-8515, Japan
Francesc A. Muntaner-Batle Graph Theory and Applications Research Group, School of Electrical Engineering and Computer Science, Faculty of Engineering and Built Environment, The University of Newcastle, NSW 2308 Australia
Akito Oshima Graph Theory and Applications Research Group, School of Electrical Engineering and Computer Science, Faculty of Engineering and Built Environment, The University of Newcastle, NSW 2308 Australia
Abstract
The beta-number of a graph G is the smallest positive integer n for which there exists an injective function f : V (G) ! f0; 1; : : : ; ng such that each uv 2 E (G) is labeled jf (u) f (v)j and the resulting set of edge labels is fc; c + 1; : : : ; c + jE (G)j 1g for some positive integer c. The beta-number of G is +1, otherwise. If c = 1, then the resulting beta-number is called the strong beta-number of G. The gamma-number (G) of a graph G is the smallest positive integer n for which there exists an injective function f : V (G) ! [0; n] such that each uv 2 E (G) is labeled jf (u) f (v)j and the resulting edge labels are distinct. A galaxy is a forest for which each component is a star. In this paper, we determine formulas for the (strong) beta-number and gamma-number of galaxies with five components. As a corollary of these results, we provide formulas for the beta-number and gamma-number of the disjoint union of multiple copies of the same galaxies if the number of copies is odd. Based on this work, we propose a new conjecture on the beta-number of galaxies.
Publication Details
Page(s) 49-53
DOI DOI not available
Published Journal: Discrete Mathematics Letters, Volume: 1, Issue: 0, Year: 2019

Request the full text from PASTIC

Keywords
gamma-number, beta-number, graceful labeling, -valuation, strong beta-number
References
Barrientos C. .2005 .The gracefulness of unions of cycles and complete bipartite graphs. J. Combin. Math. Combin. Comput, 52 : 69-78.
Gallian J. A.,J. Combin. J. A. .2018 .A dynamic survey of graph labeling, Electron. , : DS6.
Golomb S. W. .1972 .How to number a graph. Graph Theory and Computing, : 23-37.
Ichishima R.,Muntaner-Batle F. A.,Oshima A. .2018 .On the beta-number of forests with isomorphic components. Discuss. Math. Graph Theory, 38 : 683-701.
Ichishima R.,Muntaner-Batle F. A.,Oshima A. . .On the strong beta-number of galaxies with three and four components. AKCE Int. J. Graphs Comb, : .
Ichishima R.,Muntaner-Batle F. A.,Oshima A. .2015 .The measurements of closeness to graceful graphs, Australas. , 62(2) : 197-210.
Ichishima R.,Muntaner-Batle F. A.,Oshima A. .2017 .On the beta-number of the joins of graphs, Australas. , 69(3) : 402-409.
Ichishima R.,Oshima A. .2018 .On the beta-number of linear forests with an even number of components. AKCE Int. J. Graphs Comb, 15(3) : 238-241.
Ichishima R.,A. Oshima, R. .2018 .Bounds on the gamma-number of graphs, Util. , 109 : 313-325.
Oshima A.,Ichishima R.,Muntaner-Batle F. A. .2017 .New parameters for studying graceful properties of graphs, Electron. , 60 : 3-10.
Rosa A.,N.Y. A. .1967 .On certain valuations of the vertices of a graph, Theory of Graphs (Internat. , : 349-355.
Singh T.,Pereira J.,Arumugam S. .2015 .A new measure for gracefulness of graphs, Electron. , 48 : 275-280.
0

Citations

0

Downloads

18

Views