1. bookVolume 57 (2019): Issue 2 (December 2019)
Journal Details
License
Format
Journal
First Published
22 Nov 2012
Publication timeframe
2 times per year
Languages
English
access type Open Access

L(3, 2, 1)-Labeling of Banana Trees

Published Online: 21 Dec 2020
Page range: 103 - 111
Journal Details
License
Format
Journal
First Published
22 Nov 2012
Publication timeframe
2 times per year
Languages
English
Abstract

An L(3, 2, 1)-labeling of a graph G is an assignment f from the vertex set V (G) to the set of non-negative integers such that |f (x) − f (y) | ≥ 3 if x and y are adjacent, | f (x) − f (y) | ≥ 2 if x and y are at distance 2, and | f (x) − f (y) | ≥ 1 if x and y are at distance 3, for all x and y in V (G). The L (3, 2, 1)-labeling number k (G) of G is the smallest positive integer k such that G has an L (3, 2, 1)-labeling with k as the maximum label. In this paper, we consider banana trees of type 1, banana trees of type 2 and path-union of t-copies of the star K1,n and find the k-numbers of them.

Keywords

[1] J. A. Bondy and U. S. R. Murty, Graph Theory, Springer, 2008 Search in Google Scholar

[2] W. C. Chen,H.I.Lu, andY.N.Yeh, Operations of interlaced trees and graceful trees, Southeast Asian Bull. Math., 21, (1997) Search in Google Scholar

[3] M.-L. Chia, D. Kuo, H.-Y. Liao, C.-H. Yang, and R. K.Yeh, L(3, 2, 1)-labeling of Graphs, Taiwanese Journal of Mathematics, 15 (6), (2011), 2439-2457 Search in Google Scholar

[4] J. Clippeton, J. Gehrtz, Z. Szaniszlo, and D. Torkornoo, L(3, 2, 1)-labeling of Simple Graphs, VERUM, (2006) Search in Google Scholar

[5] J. R. Griggs and R. K. Yeh, Labeling graphs with a condition at distance 2, SIAM J. Discrete Math., 5, (1992), 586-595 Search in Google Scholar

[6] W. K. Hale, Frequency assignment, Theory and application, Proc. IEEE, 68, (1980), 1497-1514 Search in Google Scholar

[7] J.-Z. Liu and Z.-D. Shao,The L(3, 2, 1)-labeling problem on graphs, Mathematica Applicata, 17(4), (2004), 596-602 Search in Google Scholar

[8] M. Murugan, Topics in Graph Theory and Algorithms, Revised Edition, Muthali Publishing House, Chennai, India, 2018 Search in Google Scholar

[9] M. Murugan and M.Suriya, k-number of special family of graphs, International J. Math. Combin., 1, (2020), 77-85 Search in Google Scholar

[10] F. S. Roberts, T -colorings of graphs, Discrete Math., 93, (1991), 229-245 Search in Google Scholar

[11] Z.-D. Shao,The L(3, 2, 1)-labeling problem on graphs, J. Qufu Normal University, 30(3), (2004), 24-28 Search in Google Scholar

[12] S.-C. Shee and Y.-S. Ho, The cordiality of the path-union of n copies of a graph, Discrete Mathematics, 151, (1996), 221-229 Search in Google Scholar

Recommended articles from Trend MD

Plan your remote conference with Sciendo