Eigenvalues and colorings of digraphs
DOI10.1016/J.LAA.2009.05.027zbMATH Open1218.05097OpenAlexW2091452762MaRDI QIDQ962116FDOQ962116
Publication date: 6 April 2010
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2009.05.027
spectral radiuschromatic numbereigenvaluedigraphdigraph coloringacyclic setbrooks theoremnon-negative matrix
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Eigenvalues, singular values, and eigenvectors (15A18) Positive matrices and their generalizations; cones of matrices (15B48) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Matrix Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- The circular chromatic number of a digraph
- Title not available (Why is that?)
- The dichromatic number of a digraph
- Spectra of digraphs
- Title not available (Why is that?)
- The Eigenvalues of a Graph and Its Chromatic Number
- Title not available (Why is that?)
- Circular colorings of edge-weighted graphs
Cited In (28)
- Large regular bipartite graphs with median eigenvalue 1
- Hajós and Ore constructions for digraphs
- A Cvetković-type theorem for coloring of digraphs
- The \(m\)-degenerate chromatic number of a digraph
- On the minimum number of arcs in \(k\)-dicritical oriented graphs
- Two results on the digraph chromatic number
- Complex adjacency spectra of digraphs
- Spectral radius of digraphs with given dichromatic number
- The \(A_\alpha\) spectral moments of digraphs with a given dichromatic number
- A note on coloring digraphs of large girth
- Extremizing first eigenvalue of 3-colored digraphs made with given blocks
- The signless Laplacian and distance signless Laplacian spectral radius of digraphs with some given parameters
- The distance spectral radius of digraphs
- A new kind of Hermitian matrices for digraphs
- Bounds for the eccentricity spectral radius of join digraphs with a fixed dichromatic number
- The minimum number of edges in 4-critical digraphs of given order
- Digraph coloring and distance to acyclicity
- Dichromatic polynomial of product digraphs
- Geometric and spectral analysis on weighted digraphs
- Sharp bounds for Laplacian spectral moments of digraphs with a fixed dichromatic number
- New eigenvalue bound for the fractional chromatic number
- Four proofs of the directed Brooks' theorem
- Spectral radius of strongly connected digraphs
- Digraphs and Variable Degeneracy
- Colorings and spectral radius of digraphs
- Colorings in digraphs from the spectral radius
- Various bounds on the minimum number of arcs in a \(k\)-dicritical digraph
- The edge density of critical digraphs
This page was built for publication: Eigenvalues and colorings of digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q962116)