On the second largest distance eigenvalue of a block graph
From MaRDI portal
Publication:2174519
DOI10.1016/j.laa.2020.01.014zbMath1437.05156OpenAlexW2999766296WikidataQ126379706 ScholiaQ126379706MaRDI QIDQ2174519
Huiqiu Lin, Jin-Long Shu, Jie Xue
Publication date: 21 April 2020
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2020.01.014
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Graph designs and isomorphic decomposition (05C51)
Related Items (3)
On the \(A_\sigma\)-spectral radii of graphs with some given parameters ⋮ Perfect matching and distance spectral radius in graphs and bipartite graphs ⋮ On graphs whose third largest distance eigenvalue dose not exceed \(-1\)
Cites Work
- Unnamed Item
- The extremal spectral radii of \(k\)-uniform supertrees
- On a conjecture concerning spanning tree invariants and loop systems
- Distance spectral radius of uniform hypergraphs
- The Laplacian spectral radius of a graph under perturbation
- On the sum of \(k\) largest distance eigenvalues of graphs
- Distance spectra of graphs: a survey
- Proof of a conjecture involving the second largest \(D\)-eigenvalue and the number of triangles
- On distance integral graphs
- On the least distance eigenvalue and its applications on the distance spread
- On the distance spectrum of graphs
- On the second largest distance eigenvalue of a graph
- Connectivity and minimal distance spectral radius of graphs
- Inverse of the distance matrix of a block graph
- Distance spectral radius of trees with fixed maximum degree
- Graphs with small diameter determined by their $D$-spectra
- On spectral radius of the distance matrix
- On the distance spectrum of trees
- On the second largest distance eigenvalue
This page was built for publication: On the second largest distance eigenvalue of a block graph