Distance signless Laplacian spectrum of a graph
Huicai JIA , Wai Chee SHIU
Front. Math. China ›› 2022, Vol. 17 ›› Issue (4) : 653 -672.
Distance signless Laplacian spectrum of a graph
Let G be a simple connected graph with n vertices. The transmission Tv of a vertex v is defined to be the sum of the distances from v to all other vertices in G, that is, Tv = Σu∈V duv, where duv denotes the distance between u and v. Let T1, ..., Tn be the transmission sequence of G. Let = (dij)n×n be the distance matrix of G, and be the transmission diagonal matrix diag(T1, ..., Tn). The matrix is called the distance signless Laplacian of G. In this paper, we provide the distance signless Laplacian spectrum of complete k-partite graph, and give some sharp lower and upper bounds on the distance signless Laplacian spectral radius q(G).
Distance signless Laplacian / spectral radius / bound
| [1] |
|
| [2] |
|
| [3] |
|
| [4] |
|
| [5] |
|
| [6] |
|
| [7] |
|
| [8] |
|
| [9] |
|
| [10] |
|
| [11] |
|
Higher Education Press
/
| 〈 |
|
〉 |