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

CHROMATIC BOUNDS OF A LINE GRAPH USING SIGNLESS LAPLACIAN VALUES

Authors

  • Kajal Mittal
  • Pranjali Kekre

Keywords:

line graph, chromatic number, domination number, signless Laplacian matrix, spectrum

DOI:

https://doi.org/10.17654/0974165825004

Abstract

In this paper, we utilize the signless Laplacian eigenvalues of line graphs and the dominant number to determine the limits of chromatic numbers for the line graphs of certain special graphs. The application of Vizing’s theorem helps to justify the existence of larger boundaries in this particular case.

Received: July 1, 2024
Revision: September 23, 2024
Accepted: October 30, 2024

References

D. Cvetkovic, Chromatic number and the spectrum of a graph, Publ. Inst. Math. (Beograd) 14(28) (1972), 25-38.

G. Chartrand and P. Zhang, Chromatic graph theory, Discrete Math. Appl., CRC Press, Taylor & Francis Group, 2009, pp. 249-250.

D. Gernert, Inequalities between the domination number and the chromatic number of a graph, Discrete Math. 76(2) (1989), 151-153.

A. J. Hoffman, On eigenvalues and colorings of graphs, Graph Theory its Appl., Academic Press, New York, 1970, pp. 79-91.

P. Kekre and K. Mittal, Signless Laplacian spectrum of line graph, J. Calcutta Math. Soc. 19(1) (2023), 15-28.

P. Kekre and K. Mittal, Bounds and algorithm for the domination number of line graph using signless Laplacian matrix, Indian J. Nat. Sci. 3(75) (2022), 51497-51505.

M. Li, S. Zhang, C. Wang and C. Ye, Total dominator edge chromatic number of graphs, Int. J. Appl. Math. 51(4) (2021), 1-6.

L. S. de Lima, C. S. Oliveira, N. M. M. de Abreu and V. Nikiforov, The smallest eigenvalue of the signless Laplacian, Linear Algebra Appl. 435(10) (2011), 2570-2584.

J. Umamaheswari and R. Mithra, The study of edge coloring and chromatic graph theory and its applications, Materials Today: Proceedings (2021).

1016/j.matpr.2020.10.138.

A. Mansuri and R. S. Chandel, On harmonious chromatic number of and Jnanabha 53(2) (2023), 248-251.

M. R. Oboudi, Chromatic number and signless Laplacian spectral radius of graphs, Trans. Comb. 11(4) (2022), 327-334.

M. R. Oboudi, On the smallest signless Laplacian eigenvalue of graphs, Linear Algebra Appl. 637 (2022), 138-156.

S. Pirzada and S. Khan, Distance Laplacian eigenvalues of graphs and chromatic and independence number, (2022). https://doi.org/10.48550/arXiv.2202.05987.

T. Ramachandran and N. Deepika, Vertex coloring of graph using adjacency matrix, IJERA 10(4) (2020), 1-5.

W. Wang, Z. Yan and J. Qian, Eigenvalues and chromatic number of a signed graph, Linear Algebra Appl. 619 (2021), 137-145.

Downloads

Published

2024-11-21

Issue

Vol. 42 No. 1 (2025)

Section

Articles

License

Copyright (c) 2025 PUSHPA PUBLISHING HOUSE, PRAYAGRAJ, INDIA

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

_________________________

Licensing Terms:

Attribution: Credit Pushpa Publishing House as the original publisher, including title and author(s) if applicable.

Contact Pushpa Publishing House for more info or permissions.

How to Cite

CHROMATIC BOUNDS OF A LINE GRAPH USING SIGNLESS LAPLACIAN VALUES. (2024). Advances and Applications in Discrete Mathematics, 42(1), 55-68. https://doi.org/10.17654/0974165825004

Similar Articles

1-10 of 177

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