Bounds on the entries of the principal eigenvector of the distance signless Laplacian matrix
DOI10.1016/j.laa.2015.06.003zbMath1319.05086OpenAlexW582575191MaRDI QIDQ490889
Maria Aguieiras A. de Freitas, Celso M. jun. da Silva, Renata R. Del-Vecchio, Kinkar Chandra Das
Publication date: 21 August 2015
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2015.06.003
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (8)
Cites Work
- Unnamed Item
- Unnamed Item
- Further results on the spectral radius of matrices and graphs
- Two Laplacians for the distance matrix of a graph
- Maximal and minimal entry in the principal eigenvector for the distance matrix of a graph
- Proof of conjectures on the distance signless Laplacian eigenvalues of graphs
- A sharp upper bound on the maximal entry in the principal eigenvector of symmetric nonnegative matrix
- On maximal entries in the principal eigenvector of graphs
- Distance spectra of graphs: a survey
- On the distance and distance signless Laplacian spectral radii of bicyclic graphs
- On the distance signless Laplacian spectral radius of graphs
- A necessary and sufficient eigenvector condition for a connected graph to be bipartite
- On the bounds of maximal entries in the principal eigenvector of symmetric nonnegative matrix
This page was built for publication: Bounds on the entries of the principal eigenvector of the distance signless Laplacian matrix