On the minimal distance spectral radius in the class of bicyclic graphs
From MaRDI portal
(Redirected from On the minimal distance spectral radius in the class of bicyclic graphs)
Recommendations
Cites work
- Connectivity and minimal distance spectral radius of graphs
- Distance spectral radius of graphs with \(r\) pendent vertices
- New Bounds on the Complexity of the Shortest Path Problem
- On the Addressing Problem for Loop Switching
- On the distance spectral radius of bipartite graphs
- On the distance spectral radius of cacti
- On the distance spectral radius of trees
- Some graft transformations and its application on a distance spectrum
- The distance spectrum of the pathPnand The First Distance Eigenvector of Connected Graphs
Cited in
(7)- On the distance spectrum of minimal cages and associated distance biregular graphs
- Computing the determinant of the distance matrix of a bicyclic graph
- Connectivity, diameter, independence number and the distance spectral radius of graphs
- Ordering trees by their distance spectral radii
- The bicyclic graph with the minimum distance Laplacian spectral radius
- On the maximal distance spectral radius in a class of bicyclic graphs
- On distance spectral radius of books
This page was built for publication: On the minimal distance spectral radius in the class of bicyclic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5411809)