L(2,1)-LABELING ON SEVERAL FAMILIES OF STAR GRAPHS

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.

Authors

Publication Details

Journal
AL-MANTIQ Journal of Mathematics Education Mathematics Science and Applications
Published
2026-11-20
DOI
https://doi.org/10.62097/417ske95
Primary Topic
Graph Labeling and Dimension Problems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

L(2,1)-LABELING ON SEVERAL FAMILIES OF STAR GRAPHS

Musrifatus Sholehah, Siti Nur Afifah, Hafif Komarullah
AL-MANTIQ Journal of Mathematics Education Mathematics Science and Applications
Graph Labeling and Dimension Problems
article

L(2,1)-LABELING ON SEVERAL FAMILIES OF STAR GRAPHS

Musrifatus Sholehah, Siti Nur Afifah, Hafif Komarullah
article en

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.

AL-MANTIQ Journal of Mathematics Education Mathematics Science and Applications
Graph Labeling and Dimension Problems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon