On distance Laplacian and distance signless Laplacian eigenvalues of graphs
From MaRDI portal
Publication:5235778
DOI10.1080/03081087.2018.1491522zbMath1422.05062OpenAlexW2840911871MaRDI QIDQ5235778
No author found.
Publication date: 14 October 2019
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2018.1491522
diameterindependence numberdomination numberdistance signless Laplacian eigenvaluesdistance Laplacian eigenvalues
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
NEW BOUNDS AND EXTREMAL GRAPHS FOR DISTANCE SIGNLESS LAPLACIAN SPECTRAL RADIUS, On the distance Laplacian spectral radius of bicyclic graphs, On (distance) signless Laplacian spectra of graphs, On distance Laplacian spectral determination of complete multipartite graphs, Unnamed Item, Domination and Spectral Graph Theory
Cites Work
- Unnamed Item
- Two Laplacians for the distance matrix of a graph
- Maximal and minimal entry in the principal eigenvector for the distance matrix of a graph
- Distance spectral radius of digraphs with given connectivity
- Proof of conjectures on the distance signless Laplacian eigenvalues of graphs
- Laplacian matrices of graphs: A survey
- Distance spectra of graphs: a survey
- On the distance Laplacian spectral radius of bipartite graphs
- On the distance Laplacian spectral radius of graphs
- On the distance and distance signless Laplacian spectral radii of bicyclic graphs
- On least distance eigenvalues of trees, unicyclic graphs and bicyclic graphs
- Complete multipartite graphs are determined by their distance spectra
- On the distance spectrum of graphs
- On the distance signless Laplacian of a graph
- On the distance signless Laplacian spectral radius of graphs
- The average distance and the independence number
- Distance Laplacian eigenvalues and chromatic number in graphs
- Sharp bounds on distance spectral radius of graphs
- Some properties of the distance Laplacian eigenvalues of a graph
- On the Addressing Problem for Loop Switching
- Matrix theory. Basic results and techniques
- On the distance and distance Laplacian eigenvalues of graphs