Spectral radii of graphs with given chromatic number

DOI10.1016/J.AML.2005.11.030zbMATH Open1109.05069OpenAlexW2163427486MaRDI QIDQ868006FDOQ868006

Authors: Qiao Li, Lihua Feng, Xiao-Dong Zhang 

Publication date: 19 February 2007

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2005.11.030

Recommendations

• The signless Laplacian spectral radius of graphs with given chromatic number
• Signless Laplacian spectral radii of graphs with given chromatic number
• A lower bound for the distance signless Laplacian spectral radius of graphs in terms of chromatic number
• Spectral radius of digraphs with given dichromatic number
• Chromatic number and spectral radius

zbMATH Keywords

Turán graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Eigenspaces of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• An improved bound on the minimal number of edges in color-critical graphs
• Bounds of eigenvalues of graphs
• Lower bounds for the clique and the chromatic numbers of a graph
• The Eigenvalues of a Graph and Its Chromatic Number
• Bounds on eigenvalues and chromatic numbers
• Title not available (Why is that?)

Cited In (31)

• A Cvetković-type theorem for coloring of digraphs
• The spectral radius of edge chromatic critical graphs
• Spectral extremal graphs for intersecting cliques
• Spectral radius of digraphs with given dichromatic number
• Spectral conditions for graphs to be \(\beta\)-deficient involving minimum degree
• The Laplacian-energy like of graphs
• Two spectral extremal results for graphs with given order and rank
• Some upper bounds on the spectral radius of a graph
• On minimally 2-(edge)-connected graphs with extremal spectral radius
• The signless Laplacian spectral radius of graphs with given chromatic number
• Maximizing the signless Laplacian spectral radius of graphs with given diameter or cut vertices
• The least eigenvalue of graphs with given connectivity
• Maximal distance spectral radius of 4-chromatic planar graphs
• Sharp bounds on the \(A_{\alpha}\)-index of graphs in terms of the independence number
• The high order spectrum of a graph and its applications in graph colouring and clique counting
• Refinement on Spectral Turán’s Theorem
• A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs
• Quotient of spectral radius, (signless) Laplacian spectral radius and clique number of graphs.
• Chromatic number and signless Laplacian spectral radius of graphs
• On a conjecture of spectral extremal problems
• On the spectral radius of graphs with a given domination number
• On the spectral radius of a class of non-odd-bipartite even uniform hypergraphs
• The \(p\)-spectral radius of \(k\)-partite and \(k\)-chromatic uniform hypergraphs
• Disproof of a conjecture on the minimum spectral radius and the domination number
• Spectral radius of strongly connected digraphs
• Distance Laplacian eigenvalues and chromatic number in graphs
• Bounds on graph eigenvalues. II
• Colorings and spectral radius of digraphs
• On the maximum spectral radius of multipartite graphs
• The \(A_{\alpha}\) spectral radius characterization of some digraphs
• Spectral conditions for some graphical properties

This page was built for publication: Spectral radii of graphs with given chromatic number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868006)