Abstract: We characterize all connected graphs with second distance eigenvalue less than .
Recommendations
- On the two largest distance eigenvalues of graph powers
- On the second largest distance eigenvalue of a graph
- Graphs determined by second smallest distance eigenvalues in given intervals
- On least distance eigenvalues of trees, unicyclic graphs and bicyclic graphs
- On the second least distance eigenvalue of a graph
Cites work
- Distance matrix polynomials of trees
- Distance spectra of graphs: a survey
- Distance spectral radius of trees with fixed maximum degree
- Graphs characterized by the second eigenvalue
- On distance matrices and Laplacians
- On graphs whose second largest eigenvalue does not exceed \((\sqrt {5}-1)/2\)
- On least distance eigenvalues of trees, unicyclic graphs and bicyclic graphs
- On the Addressing Problem for Loop Switching
- On the distance matrix of a tree
- On the distance spectral radius of bipartite graphs
- On the distance spectral radius of trees
- On the extremal values of the second largest \(Q\)-eigenvalue
- On the least distance eigenvalue of a graph
- Recent results in the theory of graph spectra
- Some graphs whose second largest eigenvalue does not exceed \(\sqrt 2\)
- Spectra of graphs
- The distance spectrum of a tree
- The distance spectrum of the pathPnand The First Distance Eigenvector of Connected Graphs
Cited in
(14)- Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\)
- Relation between the matching number and the second largest distance Laplacian eigenvalue of a graph
- On Pareto eigenvalue of distance matrix of a graph
- On the second largest distance eigenvalue of a block graph
- On graphs whose third largest distance eigenvalue dose not exceed \(-1\)
- An inequality involving the second largest and smallest eigenvalue of a distance-regular graph
- On least distance eigenvalues of trees, unicyclic graphs and bicyclic graphs
- On the second largest distance eigenvalue of a graph
- On the two largest distance eigenvalues of graph powers
- Graphs determined by second smallest distance eigenvalues in given intervals
- On the extremal values of the second largest \(Q\)-eigenvalue
- The closeness eigenvalues of graphs
- Graphs for which the second largest distance eigenvalue is less than \(- \frac{1}{2}\)
- Title not available (Why is no real title available?)
This page was built for publication: On the second largest distance eigenvalue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5741253)
