On distance Laplacian and distance signless Laplacian eigenvalues of graphs

被引：8

作者：

Das, Kinkar Ch. ^{[1
]}

Aouchiche, Mustapha ^{[2
,3
]}

Hansen, Pierre ^{[2
,3
]}

机构：

[1] Sungkyunkwan Univ, Dept Math, Suwon, South Korea

[2] GERAD, Montreal, PQ, Canada

[3] HEC Montreal, Montreal, PQ, Canada

来源：

LINEAR & MULTILINEAR ALGEBRA | 2019年 / 67卷 / 11期

基金：

新加坡国家研究基金会;

关键词：

Distance Laplacian eigenvalues; distance signless Laplacian eigenvalues; domination number; independence number; diameter; SPECTRAL-RADIUS; MATRIX;

D O I：

10.1080/03081087.2018.1491522

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let , and be, respectively, the distance matrix, the distance Laplacian matrix and the distance signless Laplacian matrix of graph G, where denotes the diagonal matrix of the vertex transmissions in G. The eigenvalues of and will be denoted by and , respectively. In this paper, we study the properties of the distance Laplacian eigenvalues and the distance signless Laplacian eigenvalues of graph G.

引用

页码：2307 / 2324

页数：18

共 23 条

[1]

[Anonymous], 2008, MATH VERS 7 0

[2]

[Anonymous], 1999, Matrix Theory: Basic Results and Techniques

[3]

[Anonymous], LINEAR MULTILINEAR A

[4] Distance Laplacian Eigenvalues and Chromatic Number in Graphs [J].