Eigenvalues and colorings of digraphs

DOI10.1016/J.LAA.2009.05.027MaRDI QIDQ962116zbMATH OpenOpenAlexFDO

Authors Bojan Mohar

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

zbMATH Keywords

acyclic setbrooks theoremchromatic numberdigraphdigraph coloringeigenvaluenon-negative matrixspectral radius

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Positive matrices and their generalizations; cones of matrices (15B48)

Cites work

• Circular colorings of edge-weighted graphs
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 3425628 (Why is no real title available?)
• scientific article; zbMATH DE number 740754 (Why is no real title available?)
• scientific article; zbMATH DE number 1498519 (Why is no real title available?)
• scientific article; zbMATH DE number 3349875 (Why is no real title available?)
• Matrix Analysis
• Spectra of digraphs
• The circular chromatic number of a digraph
• The dichromatic number of a digraph
• The Eigenvalues of a Graph and Its Chromatic Number

Cited in

(31)

• Spectral radius of strongly connected digraphs
• A note on coloring digraphs of large girth
• A Cvetković-type theorem for coloring of digraphs
• Colorings in digraphs from the spectral radius
• The minimum number of edges in 4-critical digraphs of given order
• Hajós and Ore constructions for digraphs
• A new kind of Hermitian matrices for digraphs
• The signless Laplacian and distance signless Laplacian spectral radius of digraphs with some given parameters
• Spectral radius of digraphs with given dichromatic number
• The distance spectral radius of digraphs
• The \(m\)-degenerate chromatic number of a digraph
• Extremizing first eigenvalue of 3-colored digraphs made with given blocks
• Dichromatic polynomial of product digraphs
• Two results on the digraph chromatic number
• Complex adjacency spectra of digraphs
• Colorings and spectral radius of digraphs
• Digraphs and variable degeneracy
• The edge density of critical digraphs
• Sharp bounds for Laplacian spectral moments of digraphs with a fixed dichromatic number
• Four proofs of the directed Brooks' theorem
• Various bounds on the minimum number of arcs in a k-dicritical digraph
• The A_ spectral moments of digraphs with a given dichromatic number
• Geometric and spectral analysis on weighted digraphs
• New eigenvalue bound for the fractional chromatic number
• On the minimum number of arcs in \(k\)-dicritical oriented graphs
• Bounds for the eccentricity spectral radius of join digraphs with a fixed dichromatic number
• Digraph coloring and distance to acyclicity
• Essential connectivity and spectral radius of graphs
• Brooks-type colourings of digraphs in linear time
• Random independent sets in triangle-free graphs
• Digraph coloring and distance to acyclicity

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)