On least distance eigenvalues of trees, unicyclic graphs and bicyclic graphs
From MaRDI portal
Publication:2438478
DOI10.1016/j.laa.2013.11.015zbMath1282.05131OpenAlexW2011902296WikidataQ112882232 ScholiaQ112882232MaRDI QIDQ2438478
Publication date: 5 March 2014
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2013.11.015
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (12)
On the distance spread of cacti and bicyclic graphs ⋮ The distance eigenvalues of the complements of unicyclic graphs ⋮ On the least distance eigenvalue and its applications on the distance spread ⋮ The eccentricity spread of weak-friendship graphs ⋮ The distance spectrum of the complements of graphs of diameter greater than three ⋮ The distance spectrum of the complements of graphs with two pendent vertices ⋮ On least distance eigenvalue of uniform hypergraphs ⋮ Distance spectra of graphs: a survey ⋮ On the second largest distance eigenvalue ⋮ On the least distance eigenvalues of the second power of a graph ⋮ Unnamed Item ⋮ On distance Laplacian and distance signless Laplacian eigenvalues of graphs
Cites Work
- Unnamed Item
- Some graft transformations and its applications on the distance spectral radius of a graph
- Distance spectral radius of trees with given matching number
- Distance spectral radius of graphs with \(r\) pendent vertices
- Some graft transformations and its application on a distance spectrum
- On the distance spectral radius of bipartite graphs
- On the distance matrix of a tree
- Distance matrix polynomials of trees
- On distance spectral radius of graphs
- On the least distance eigenvalue of a graph
- 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
- On Distance Spectral Radius and Distance Energy of Graphs
- On the Addressing Problem for Loop Switching
This page was built for publication: On least distance eigenvalues of trees, unicyclic graphs and bicyclic graphs