ON THE MINIMAL DISTANCE SPECTRAL RADIUS IN THE CLASS OF BICYCLIC GRAPHS
From MaRDI portal
Publication:5411809
DOI10.1142/S1793830914500141zbMath1373.05109MaRDI QIDQ5411809
Publication date: 25 April 2014
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Related Items (2)
Connectivity, diameter, independence number and the distance spectral radius of graphs ⋮ Ordering trees by their distance spectral radii
Cites Work
- On the distance spectral radius of cacti
- 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 spectral radius of trees
- Connectivity and minimal distance spectral radius of graphs
- The distance spectrum of the pathPnand The First Distance Eigenvector of Connected Graphs
- New Bounds on the Complexity of the Shortest Path Problem
- On the Addressing Problem for Loop Switching
This page was built for publication: ON THE MINIMAL DISTANCE SPECTRAL RADIUS IN THE CLASS OF BICYCLIC GRAPHS