Work

L(2,1)-labeling on Several Families of Star Graphs

Year: 2026
Type: article
Abstract: This research discusses L(2,1) labeling on some families of star graphs, namely planter graphs (R_n), lilly graphs (l_n), and umbrella graphs (U_(m,n)). The L(2,1) labeling is a type of graph labeling that assigns nonnegative integer labels to each vertex of a graph such that two vertices that are one edge apart have labels that differ by at least two, and two vertices that are two edges apart have labels that differ by at least one. This study uses axiomatic descriptive methods and pattern detection in determining the minimum span value of the L(2,1) labeling, denoted as lambda_2,1(G). The results show that lambda_2,1(R_n) = n+3, lambda_2,1(l_n) = 2n+3, and lambda_2,1(U_(m,n)) = m+2. These three graphs were chosen because their L(2,1) labeling is still an open problem and has not been widely studied in previous literature. This research is expected to contribute to the development of graph labeling theory and serve as an initial reference for future researchers. A suggestion for further research is to explore the minimum value of the L(2,1) labeling range in other classes of graphs that have not yet been determined.
Language: English
Open Access status: hybrid
OpenAlex ID: W7220225160
FWCI:
Cites:
Cited by:
Related to: 10