Bounds on maximal and minimal entries of the \(p\)-normalized principal eigenvector of the distance and distance signless Laplacian matrices of graphs
From MaRDI portal
Publication:1756045
DOI10.1007/S00373-018-1927-3zbMath1402.05133OpenAlexW2884929149MaRDI QIDQ1756045
Fouzul Atik, Pratima Panigrahi
Publication date: 11 January 2019
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-018-1927-3
distance matrixdistance signless Laplacian matrix\(p\)-normalized principal eigenvectortransmission regular graph
Related Items (2)
Matching number, connectivity and eigenvalues of distance signless Laplacians ⋮ Bounds for Generalized Distance Spectral Radius and the Entries of the Principal Eigenvector
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Bounds on the entries of the principal eigenvector of the distance signless Laplacian matrix
- 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 maximal and minimal entries of the \(p\)-normalized principal eigenvector of the distance and distance signless Laplacian matrices of graphs
