Advances and Applications in Discrete Mathematics

The Advances and Applications in Discrete Mathematics is a prestigious peer-reviewed journal indexed in the Emerging Sources Citation Index (ESCI). It is dedicated to publishing original research articles in the field of discrete mathematics and combinatorics, including topics such as graphs, coding theory, and block design. The journal emphasizes efficient and powerful tools for real-world applications and welcomes expository articles that highlight current developments in the field.

Submit Article

ON $L(3,2,1)$-LABELING INDEX OF A GRAPH

Authors

  • Vijayalaxmi S. Shigehalli
  • Nagaveni Y. Neeralakeri

Keywords:

labeling, $L(3,2,1)$-labeling, degree-index.

DOI:

https://doi.org/10.17654/0974165825032

Abstract

Graph labeling is a versatile tool used across diverse scientific and engineering fields where complex systems are represented as graphs.  It provides a structured approach to understand, manipulate, and optimize these systems. By applying graph labeling techniques, researchers and practitioners can analyze signal flow, optimize circuit designs, allocate frequencies in communication networks, model molecular structures in X-ray crystallography, design error-correcting codes in coding theory, plan trajectories in missile guidance systems, and address numerous other challenges in fields ranging from telecommunications to molecular biology. In this paper, we have introduced the -labeling index of a graph and obtained bounds for this new parameter.

Received: March 17, 2025
Revised: March 21, 2025
Accepted: May 9, 2025

References

W. K. Hale, Frequency assignment: theory and applications, Proc. IEEE 68 (1980), 1497-1514.

J. Griggs and R. K. Yeh, Labeling graphs with a condition at distance two, SIAM J. Discrete Math. 5 (1992), 586-595.

A. A. Bertossi and C. M. Pinotti, Approximate -coloring of trees and interval graphs, Networks 49(3) (2007), 204-216.

J. Clipperton, J. Gehrtz, Z. Szaniszlo and D. Torkornoo, -labeling of simple graphs, VERUM, Valparaiso University, 2006.

M. L. Chia, D. Qua, H. Liao, C. Yang and R. K. Yea, -labeling of graphs, Taiwanese J. Math. 15(6) (2011), 2439-2457.

S. Paul, M. Pal and A. Pal, -labeling of permutation and bipartite permutation graphs, Math. Comput. Sci. 9(1) (2014), 113-123.

S. Paul, M. Pal and A. Pal, -labeling of permutation graph, J. Math. Model. Algorithms Oper. Res. 14(4) (2015), 469-479.

Zhen-dong Shao and Jia-zhuang Liu, The -labeling problem on graphs, Math. Appl. (Wuhan) 17(4) (2004), 596-602.

F. S. Roberts, T-colorings of graphs: recent results and open problems, Discrete Math. 93(2-3) (1991), 229-245.

Published

2025-06-10

Issue

Section

Articles

How to Cite

ON $L(3,2,1)$-LABELING INDEX OF A GRAPH. (2025). Advances and Applications in Discrete Mathematics, 42(5), 481-493. https://doi.org/10.17654/0974165825032

Similar Articles

1-10 of 46

You may also start an advanced similarity search for this article.