Spectral radius of strongly connected digraphs

DOI10.1016/J.DISC.2012.07.009MaRDI QIDQ1759409zbMATH OpenOpenAlexFDO

Authors Huiqiu Lin, Yarong Wu, Guanglong Yu, Jinlong Shu

Publication date 20 November 2012

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2012.07.009

zbMATH Keywords

spectral radiusclique numbergirthvertex connectivityBrualdi-Li tournament

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Connectivity (05C40)

Recommendations

• Improved upper and lower bounds for the spectral radius of digraphs
• The distance spectral radius of digraphs
• On the \(A_\alpha\) spectral radius of digraphs with given parameters
• Sharp bounds for the spectral radius of digraphs
• Improved bounds for the spectral radius of digraphs

Cites work

• scientific article; zbMATH DE number 193132 (Why is no real title available?)
• scientific article; zbMATH DE number 1498519 (Why is no real title available?)
• A note on the spectral characterization of strongly connected bicyclic digraphs
• A numerical radius inequality and an estimate for the numerical radius of the Frobenius companion matrix
• A sharp upper bound of the spectral radius of graphs
• An introduction to the theory of graph spectra
• Distance spectral radius of digraphs with given connectivity
• Eigenvalues and colorings of digraphs
• Graph theory
• Lower bounds for the numerical radius
• Numerical radius and zero pattern of matrices
• On the characteristic roots of tournament matrices
• Perron-Frobenius type results on the numerical range
• Singular values of tournament matrices
• Solution of the conjecture of Brualdi and Li
• Some remarks on tournament matrices
• Spectra of digraphs
• Spectral bounds for the clique and independence numbers of graphs
• Spectral radii of graphs with given chromatic number
• Spectral radius of digraphs with given dichromatic number
• The circular chromatic number of a digraph
• The dichromatic number of a digraph
• The numerical range of a nonnegative matrix
• The spectral radius of trees on \(k\) pendant vertices

Cited in

(27)

• The maximum Perron roots of digraphs with some given parameters
• On the \(A_\alpha\) spectral radius of digraphs with given parameters
• Spectral radius and signless Laplacian spectral radius of strongly connected digraphs
• On the spectrum of an equitable quotient matrix and its application
• A note on the spectral characterization of strongly connected bicyclic digraphs
• Connected hypergraphs with small spectral radius
• Some upper bounds for the signless Laplacian spectral radius of digraphs
• Improved bounds for the spectral radius of digraphs
• On the generalized adjacency spectral radius of digraphs
• The signless Laplacian and distance signless Laplacian spectral radius of digraphs with some given parameters
• Sharp bounds for the spectral radius of digraphs
• Improved upper and lower bounds for the spectral radius of digraphs
• scientific article; zbMATH DE number 2105656 (Why is no real title available?)
• On the \(A_\alpha\)- spectral radius of Halin graphs
• Bounds for the eccentricity spectral radius of join digraphs with a fixed dichromatic number
• The maximal spectral radius of a digraph with (m+1)^2-s edges
• scientific article; zbMATH DE number 7735895 (Why is no real title available?)
• \(l\)-connectivity, \(l\)-edge-connectivity and spectral radius of graphs
• Extremal digraphs with given clique number
• Spectral radius and \(k\)-connectedness of a graph
• On the A_ɑ spectral radius of strongly connected digraphs
• Colorings and spectral radius of digraphs
• On the spectral radius of the generalized adjacency matrix of a digraph
• The (distance) signless Laplacian spectral radius of digraphs with given arc connectivity
• The \(A_{\alpha}\) spectral radius characterization of some digraphs
• On the spectral radius of simple digraphs with prescribed number of arcs
• Dominant eigenvalue and universal winners of digraphs

This page was built for publication: 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 Q1759409)