A note on the spectral characterization of strongly connected bicyclic digraphs

DOI10.1016/j.laa.2011.09.018zbMath1238.05163MaRDI QIDQ2427939

Huiqiu Lin, Jin-Long Shu

Publication date: 19 April 2012

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2011.09.018

zbMATH Keywords

spectral radius; bicyclic digraph; \(\infty \)-digraph; \(\theta \)-digraph

Mathematics Subject Classification ID

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

05C20: Directed graphs (digraphs), tournaments

Related Items

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, Characterization of digraphs with three complementarity eigenvalues, On the coefficients of skew Laplacian characteristic polynomial of digraphs, Dual solutions of a mixed convection flow near the stagnation point region over an exponentially stretching/shrinking sheet in nanofluids, Colorings and spectral radius of digraphs, Bicyclic digraphs with maximal energy, The \(A_{\alpha}\) spectral radius characterization of some digraphs, Spectral radius of strongly connected digraphs, Complementarity spectrum of digraphs, Spectral radius and signless Laplacian spectral radius of strongly connected digraphs, On the second largest \(A_{\alpha}\)-eigenvalues of graphs, The (distance) signless Laplacian spectral radius of digraphs with given arc connectivity, Spectral norm of oriented graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the spectral characterization of dumbbell graphs
• Spectra of digraphs
• On the spectral characterizations of \(\infty \)-graphs
• Developments on spectral characterizations of graphs
• Spectral bounds for the clique and independence numbers of graphs
• Which graphs are determined by their spectrum?
• The spectral radius of trees on \(k\) pendant vertices
• A sharp upper bound of the spectral radius of graphs
• An iterative construction of isospectral digraphs
• Constructing isospectral non‐isomorphic digraphs from hypergraphs