Spectral radius of digraphs with given dichromatic number
From MaRDI portal
Publication:2431161
DOI10.1016/j.laa.2010.12.026zbMath1226.05126OpenAlexW2001517609MaRDI QIDQ2431161
Publication date: 11 April 2011
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2010.12.026
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)
Related Items (18)
On the A_ɑ spectral radius of strongly connected digraphs ⋮ On the \(A_\alpha\)- spectral radius of Halin graphs ⋮ The digrundy number of digraphs ⋮ On the Aα spectral radius of digraphs with given parameters ⋮ Some α -spectral extremal results for some digraphs ⋮ Sharp bounds for Laplacian spectral moments of digraphs with a fixed dichromatic number ⋮ The \(A_\alpha\) spectral moments of digraphs with a given dichromatic number ⋮ The \(A_{\alpha}\) spectral radius characterization of some digraphs ⋮ The distance spectral radius of digraphs ⋮ Spectral radius and signless Laplacian spectral radius of strongly connected digraphs ⋮ Spectral radius of strongly connected digraphs ⋮ The (distance) signless Laplacian spectral radius of digraphs with given arc connectivity ⋮ The diachromatic number of digraphs ⋮ Complex adjacency spectra of digraphs ⋮ A Cvetković-type theorem for coloring of digraphs ⋮ Colorings in digraphs from the spectral radius ⋮ On the spectral radius of simple digraphs with prescribed number of arcs ⋮ The signless Laplacian and distance signless Laplacian spectral radius of digraphs with some given parameters
Cites Work
- Unnamed Item
- Unnamed Item
- Spectral radii of graphs with given chromatic number
- The minimal spectral radius of graphs with a given diameter
- Spectra of digraphs
- Eigenvalues and colorings of digraphs
- Spectral bounds for the clique and independence numbers of graphs
- The spectral radius of trees on \(k\) pendant vertices
- The dichromatic number of a digraph
- A sharp upper bound of the spectral radius of graphs
- Bounds on graph eigenvalues. II
- Laplacian spectral bounds for clique and independence numbers of graphs
- Matrix Analysis
- Circular colorings of edge-weighted graphs
- The circular chromatic number of a digraph
This page was built for publication: Spectral radius of digraphs with given dichromatic number