Bounds on the entries of the principal eigenvector of the distance signless Laplacian matrix
DOI10.1016/J.LAA.2015.06.003zbMATH Open1319.05086OpenAlexW582575191MaRDI QIDQ490889FDOQ490889
Maria Aguieiras A. de Freitas, Celso M. jun. da Silva, Renata Del-Vecchio, Kinkar Ch. 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
Recommendations
- Maximal and minimal entry in the principal eigenvector for the distance matrix of a graph
- New bounds and extremal graphs for distance signless Laplacian spectral radius
- Bounds on maximal and minimal entries of the \(p\)-normalized principal eigenvector of the distance and distance signless Laplacian matrices of graphs
- On the distance signless Laplacian spectral radius and the distance signless Laplacian energy of graphs
- Bounds on the distance signless Laplacian spectral radius in terms of clique number
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12)
Cites Work
- Distance spectra of graphs: a survey
- Two Laplacians for the distance matrix of a graph
- On the distance and distance signless Laplacian spectral radii of bicyclic graphs
- Further results on the spectral radius of matrices and graphs
- On the distance signless Laplacian spectral radius of graphs
- Proof of conjectures on the distance signless Laplacian eigenvalues of graphs
- A lower bound for the distance signless Laplacian spectral radius of graphs in terms of chromatic number
- On maximal entries in the principal eigenvector of graphs
- Principal eigenvectors of irregular graphs
- Maximal and minimal entry in the principal eigenvector for the distance matrix of a graph
- On the bounds of maximal entries in the principal eigenvector of symmetric nonnegative matrix
- A sharp upper bound on the maximal entry in the principal eigenvector of symmetric nonnegative matrix
- A necessary and sufficient eigenvector condition for a connected graph to be bipartite
Cited In (9)
- Principal eigenvector of the signless Laplacian matrix
- NEW BOUNDS AND EXTREMAL GRAPHS FOR DISTANCE SIGNLESS LAPLACIAN SPECTRAL RADIUS
- Bounds for Generalized Distance Spectral Radius and the Entries of the Principal Eigenvector
- Matching number, connectivity and eigenvalues of distance signless Laplacians
- On distance signless Laplacian spectrum and energy of graphs
- Bounds on maximal and minimal entries of the \(p\)-normalized principal eigenvector of the distance and distance signless Laplacian matrices of graphs
- On the principal eigenvectors of uniform hypergraphs
- A sharp upper bound on the maximal entry in the principal eigenvector of symmetric nonnegative matrix
- Some results on matrices with respect to resistance distance
This page was built for publication: Bounds on the entries of the principal eigenvector of the distance signless Laplacian matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490889)
