Distance and distance signless Laplacian spread of connected graphs

DOI10.1016/J.DAM.2016.12.030zbMATH Open1465.05109arXiv1607.00473OpenAlexW2963885395MaRDI QIDQ2030445FDOQ2030445

Guanglong Yu, Lihua You, Liyong Ren

Publication date: 7 June 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Abstract: For a connected graph $G$ on $n$ vertices, recall that the distance signless Laplacian matrix of $G$ is defined to be $mathcalQ(G)=Tr(G)+mathcalD(G)$, where $mathcalD(G)$ is the distance matrix, $Tr(G)=diag(D_1,D_2,ldots,D_n)$ and $D_i$ is the row sum of $mathcalD(G)$ corresponding to vertex $v_i$. Denote by $h{o}^{mathcalD}(G),$ $h{o}_{min}^{mathcalD}(G)$ the largest eigenvalue and the least eigenvalue of $mathcalD(G)$, respectively. And denote by $q^{mathcalD}(G)$, $q_{min}^{mathcalD}(G)$ the largest eigenvalue and the least eigenvalue of $mathcalQ(G)$, respectively. The distance spread of a graph $G$ is defined as $S_{mathcalD}(G)=h{o}^{mathcalD}(G)-h{o}_{min}^{mathcalD}(G)$, and the distance signless Laplacian spread of a graph $G$ is defined as $S_{mathcalQ}(G)=q^{mathcalD}(G)-q_{min}^{mathcalD}(G)$. In this paper, we point out an error in the result of Theorem 2.4 in "Distance spectral spread of a graph" [G.L. Yu, et al, Discrete Applied Mathematics. 160 (2012) 2474--2478] and rectify it. As well, we obtain some lower bounds on ddistance signless Laplacian spread of a graph.

Full work available at URL: https://arxiv.org/abs/1607.00473

zbMATH Keywords

distance matrixspectral spreaddistance signless Laplacian

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Connectivity (05C40)

Cites Work

• Title not available (Why is that?)
• Interlacing eigenvalues and graphs
• Distance spectra of graphs: a survey
• On the Addressing Problem for Loop Switching
• On the least distance eigenvalue and its applications on the distance spread
• Two Laplacians for the distance matrix of a graph
• Distance spectral spread of a graph
• The spread of a matrix
• Lower bounds for the spread of a matrix
• The signless Laplacian spread
• The spread of the spectrum of a graph
• On a conjecture for the signless Laplacian spectral radius of cacti with given matching number

Cited In (7)

• Remoteness and distance, distance (signless) Laplacian eigenvalues of a graph
• Matching number, connectivity and eigenvalues of distance signless Laplacians
• Some properties of generalized distance eigenvalues of graphs.
• On the D_α-spectra of graphs
• On the eigenvalues and spread of the generalized distance matrix of a graph
• Distance Signless Laplacian Eigenvalues, Diameter, and Clique Number
• On spectral spread of generalized distance matrix of a graph

This page was built for publication: Distance and distance signless Laplacian spread of connected graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2030445)