Spectral radius of strongly connected digraphs
From MaRDI portal
Publication:1759409
DOI10.1016/J.DISC.2012.07.009zbMATH Open1254.05106OpenAlexW2150688064MaRDI QIDQ1759409FDOQ1759409
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
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Connectivity (05C40)
Cites Work
- Graph theory
- A sharp upper bound of the spectral radius of graphs
- An introduction to the theory of graph spectra
- The circular chromatic number of a digraph
- Title not available (Why is that?)
- Eigenvalues and colorings of digraphs
- Perron-Frobenius type results on the numerical range
- The spectral radius of trees on \(k\) pendant vertices
- Title not available (Why is that?)
- The dichromatic number of a digraph
- A numerical radius inequality and an estimate for the numerical radius of the Frobenius companion matrix
- Spectra of digraphs
- Spectral bounds for the clique and independence numbers of graphs
- Solution of the conjecture of Brualdi and Li
- On the characteristic roots of tournament matrices
- Distance spectral radius of digraphs with given connectivity
- The numerical range of a nonnegative matrix
- A note on the spectral characterization of strongly connected bicyclic digraphs
- Spectral radii of graphs with given chromatic number
- Lower bounds for the numerical radius
- Some remarks on tournament matrices
- Singular values of tournament matrices
- Spectral radius of digraphs with given dichromatic number
- Numerical radius and zero pattern of matrices
Cited In (27)
- Spectral radius and signless Laplacian spectral radius of strongly connected digraphs
- The maximum Perron roots of digraphs with some given parameters
- On the spectrum of an equitable quotient matrix and its application
- A note on the spectral characterization of strongly connected bicyclic digraphs
- Some upper bounds for the signless Laplacian spectral radius of digraphs
- Connected hypergraphs with small spectral radius
- On the generalized adjacency spectral radius of digraphs
- Improved bounds for the 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
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- \(l\)-connectivity, \(l\)-edge-connectivity and spectral radius of graphs
- On the A_ɑ spectral radius of strongly connected digraphs
- Extremal digraphs with given clique number
- Spectral radius and \(k\)-connectedness of a graph
- 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
- On the \(A_\alpha\) spectral radius of digraphs with given parameters
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)
