CHROMATIC BOUNDS OF A LINE GRAPH USING SIGNLESS LAPLACIAN VALUES

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.

Authors

Publication Details

Journal
Advances and Applications in Discrete Mathematics
Published
2024-11-21
DOI
https://doi.org/10.17654/0974165825004
Primary Topic
Graph theory and applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

CHROMATIC BOUNDS OF A LINE GRAPH USING SIGNLESS LAPLACIAN VALUES

K. C. Mittal, Pranjali Kekre
Advances and Applications in Discrete Mathematics
Graph theory and applications
article

CHROMATIC BOUNDS OF A LINE GRAPH USING SIGNLESS LAPLACIAN VALUES

K. C. Mittal, Pranjali Kekre
article en

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.

Advances and Applications in Discrete MathematicsVol. 42(1)
Reduced inequalities
Openalex Percentile: Top 68%
Graph theory and applications
DOIOpen Access PDFOpenAlex
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.