On the second largest distance eigenvalue
From MaRDI portal
Publication:5741253
DOI10.1080/03081087.2015.1127317zbMath1344.05092arXiv1406.3679OpenAlexW2231359727MaRDI QIDQ5741253
Publication date: 22 July 2016
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.3679
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)
Related Items (6)
Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\) ⋮ On the second largest distance eigenvalue of a block graph ⋮ The closeness eigenvalues of graphs ⋮ On the second largest distance eigenvalue of a graph ⋮ On the two largest distance eigenvalues of graph powers ⋮ On graphs whose third largest distance eigenvalue dose not exceed \(-1\)
Cites Work
- Some graphs whose second largest eigenvalue does not exceed \(\sqrt 2\)
- On the extremal values of the second largest \(Q\)-eigenvalue
- Spectra of graphs
- On the distance spectral radius of bipartite graphs
- Recent results in the theory of graph spectra
- On the distance matrix of a tree
- Distance matrix polynomials of trees
- On distance matrices and Laplacians
- On graphs whose second largest eigenvalue does not exceed \((\sqrt {5}-1)/2\)
- Distance spectra of graphs: a survey
- On the least distance eigenvalue of a graph
- On least distance eigenvalues of trees, unicyclic graphs and bicyclic graphs
- On the distance spectral radius of trees
- The distance spectrum of the pathPnand The First Distance Eigenvector of Connected Graphs
- The distance spectrum of a tree
- Distance spectral radius of trees with fixed maximum degree
- Graphs characterized by the second eigenvalue
- On the Addressing Problem for Loop Switching
This page was built for publication: On the second largest distance eigenvalue