On spectral spread of generalized distance matrix of a graph

From MaRDI portal
Publication:5043667

DOI10.1080/03081087.2020.1814194zbMATH Open1498.05173arXiv1907.09462OpenAlexW3084065946MaRDI QIDQ5043667FDOQ5043667


Authors:


Publication date: 6 October 2022

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Abstract: For a simple connected graph G, let D(G), Tr(G), DL(G) and DQ(G), respectively be the distance matrix, the diagonal matrix of the vertex transmissions, distance Laplacian matrix and the distance signless Laplacian matrix of a graph G. The convex linear combinations Dalpha(G) of Tr(G) and D(G) is defined as Dalpha(G)=alphaTr(G)+(1alpha)D(G), 0leqalphaleq1. As D0(G)=D(G),2Dfrac12(G)=DQ(G),D1(G)=Tr(G) and , this matrix reduces to merging the distance spectral, distance Laplacian spectral and distance signless Laplacian spectral theories. Let partial1(G)geqpartial2(G)geqdotsgeqpartialn(G) be the eigenvalues of Dalpha(G) and let DalphaS(G)=partial1(G)partialn(G) be the generalized distance spectral spread of the graph G. In this paper, we obtain some bounds for the generalized distance spectral spread Dalpha(G). We also obtain relation between the generalized distance spectral spread Dalpha(G) and the distance spectral spread SD(G). Further, we obtain the lower bounds for DalphaS(G) of bipartite graphs involving different graph parameters and we characterize the extremal graphs for some cases. We also obtain lower bounds for DalphaS(G) in terms of clique number and independence number of the graph G and characterize the extremal graphs for some cases.


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




Recommendations




Cites Work


Cited In (7)





This page was built for publication: On spectral spread of generalized distance matrix of a graph

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