On spectral radius of strongly connected digraphs
From MaRDI portal
Publication:2411897
Abstract: We determine the digraphs which achieve the second, the third and the fourth minimum spectral radii respectively among strongly connected digraphs of order , and thus we answer affirmatively the problem whether the unique digraph which achieves the minimum spectral radius among all strongly connected bicyclic digraphs of order achieves the second minimum spectral radius among all strongly connected digraphs of order for proposed in [H. Lin, J. Shu, A note on the spectral characterization of strongly connected bicyclic digraphs, Linear Algebra Appl. 436 (2012) 2524--2530]. We also discuss the strongly connected bicyclic digraphs with small and large spectral radii respectively.
Recommendations
- Colorings and spectral radius of digraphs
- On the distance spectral radius of digraphs with given diameter
- The distance spectral radius of digraphs
- The \(A_{\alpha}\) spectral radius characterization of some digraphs
- Spectral radius and signless Laplacian spectral radius of strongly connected digraphs
Cited in
(11)- The (distance) signless Laplacian spectral radius of digraphs with given arc connectivity
- A note on the spectral characterization of strongly connected bicyclic digraphs
- On the sum-connectivity spectral radius and sum-connectivity Estrada index of graphs.
- Connected hypergraphs with small spectral radius
- Minimal strong digraphs
- On the distance spectral radius of digraphs with given diameter
- Colorings and spectral radius of digraphs
- On the A_ɑ spectral radius of strongly connected digraphs
- Some α -spectral extremal results for some digraphs
- The first three largest values of the spectral norm of oriented bicyclic graphs
- Bicyclic digraphs with maximal energy
This page was built for publication: On spectral radius of strongly connected digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2411897)