On spectral spread of generalized distance matrix of a graph
From MaRDI portal
Publication:5043667
Abstract: For a simple connected graph , let , , and , respectively be the distance matrix, the diagonal matrix of the vertex transmissions, distance Laplacian matrix and the distance signless Laplacian matrix of a graph . The convex linear combinations of and is defined as , . As and , this matrix reduces to merging the distance spectral, distance Laplacian spectral and distance signless Laplacian spectral theories. Let be the eigenvalues of and let be the generalized distance spectral spread of the graph . In this paper, we obtain some bounds for the generalized distance spectral spread . We also obtain relation between the generalized distance spectral spread and the distance spectral spread . Further, we obtain the lower bounds for of bipartite graphs involving different graph parameters and we characterize the extremal graphs for some cases. We also obtain lower bounds for in terms of clique number and independence number of the graph and characterize the extremal graphs for some cases.
Recommendations
Cites work
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- Brouwer type conjecture for the eigenvalues of distance signless Laplacian matrix of a graph
- Commutativity and spectra of Hermitian matrices
- Cospectrality of graphs with respect to distance matrices
- Distance Laplacian eigenvalues and chromatic number in graphs
- Distance and distance signless Laplacian spread of connected graphs
- Distance spectra of graphs: a survey
- Distance spectral spread of a graph
- Further results on the distance signless Laplacian spectrum of graphs
- Graphs with some distance Laplacian eigenvalue of multiplicity \(n-3\)
- Matrix Analysis
- On the \(D_\alpha\)-spectra of graphs
- On the distance Laplacian spectral radius of graphs
- On the distance and distance signless Laplacian eigenvalues of graphs and the smallest Geršgorin disc
- On the distance signless Laplacian of a graph
- On the sum of the powers of distance signless Laplacian eigenvalues of graphs
- Sharp bounds on the distance spectral radius and the distance energy of graphs
- Some properties of the distance Laplacian eigenvalues of a graph.
- Spectra of graphs
- The generalized distance matrix
- The spread of a matrix
- Two Laplacians for the distance matrix of a graph
Cited in
(13)- On the sum of the generalized distance eigenvalues of graphs
- On the second largest eigenvalue of the generalized distance matrix of graphs
- Spectral properties of the exponential distance matrix
- On generalized distance spectral radius of a bipartite graph
- Spectral spread and trace norm of eccentricity matrix of graphs
- Some properties of generalized distance eigenvalues of graphs.
- Distance spectral spread of a graph
- Sharp bounds for spectral radius of Dα-matrix of graphs
- On the bounds for the generalized distance energy of graphs
- On the smallest eigenvalue of Dα-matrix of connected graphs
- scientific article; zbMATH DE number 7754453 (Why is no real title available?)
- On the spectral gap of a square distance matrix
- The generalized distance spectrum of a graph and applications
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)