CHROMATIC BOUNDS OF A LINE GRAPH USING SIGNLESS LAPLACIAN VALUES

被引：0

作者：

Mittal, Kajal ^{[1
]}

Kekre, Pranjali ^{[1
]}

机构：

[1] Med Caps Univ, Dept Math, Pigdamber 453331, India

来源：

ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS | 2025年 / 42卷 / 01期

关键词：

line graph; chromatic number; domination number; signless Laplacian matrix; spectrum; EIGENVALUE; NUMBER;

D O I：

10.17654/0974165825004

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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.

引用

页码：55 / 68

页数：14

共 15 条

[1]

Chartrand G., 2008, Discrete Mathematics and Its Applications

[2]

Cvetkovic D., 1972, Publ. Inst. Math.(Beograd), V14, P25

[3] The smallest eigenvalue of the signless Laplacian [J].

de Lima, Leonardo Silva ;

Oliveira, Carla Silva ;

Maia de Abreu, Nair Maria ;

Nikiforov, Vladimir .

LINEAR ALGEBRA AND ITS APPLICATIONS, 2011, 435 (10) :2570-2584

[4] INEQUALITIES BETWEEN THE DOMINATION NUMBER AND THE CHROMATIC NUMBER OF A GRAPH [J].

GERNERT, D .

DISCRETE MATHEMATICS, 1989, 76 (02) :151-153

[5]

HOFFMAN AJ, 1970, GRAPH THEORY ITS APP, P79

[6]

Kekre P., 2022, IND J NAT SCI, V3, P51497

[7]

Kekre P., 2023, J. Calcutta Math. Soc., V19, P15

[8]

Li M., 2021, Int. J. Appl. Math., V51, P1

[9]

Mansuri A., 2023, Jnbha, V53, P248

[10] On the smallest signless Laplacian eigenvalue of graphs [J].

Oboudi, Mohammad Reza .

LINEAR ALGEBRA AND ITS APPLICATIONS, 2022, 637 :138-156

← 1 2 →