Spectral radii of graphs with given chromatic number
From MaRDI portal
Publication:868006
DOI10.1016/j.aml.2005.11.030zbMath1109.05069OpenAlexW2163427486MaRDI QIDQ868006
Qiao Li, Li-Hua 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
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15)
Related Items
Spectral extremal graphs for intersecting cliques, Some upper bounds on the spectral radius of a graph, Disproof of a conjecture on the minimum spectral radius and the domination number, Refinement on Spectral Turán’s Theorem, On minimally 2-(edge)-connected graphs with extremal spectral radius, On a conjecture of spectral extremal problems, Two spectral extremal results for graphs with given order and rank, Sharp bounds on the \(A_{\alpha}\)-index of graphs in terms of the independence number, Spectral radius of digraphs with given dichromatic number, The \(A_{\alpha}\) spectral radius characterization of some digraphs, Bounds on graph eigenvalues. II, Spectral conditions for graphs to be β-deficient involving minimum degree, Colorings and spectral radius of digraphs, Distance Laplacian eigenvalues and chromatic number in graphs, Spectral conditions for some graphical properties, On the spectral radius of graphs with a given domination number, Spectral radius of strongly connected digraphs, The Laplacian-energy like of graphs, Maximal distance spectral radius of 4-chromatic planar graphs, The spectral radius of edge chromatic critical graphs, The least eigenvalue of graphs with given connectivity, On the maximum spectral radius of multipartite graphs, Maximizing the signless Laplacian spectral radius of graphs with given diameter or cut vertices, Quotient of spectral radius, (signless) Laplacian spectral radius and clique number of graphs, The \(p\)-spectral radius of \(k\)-partite and \(k\)-chromatic uniform hypergraphs, On the spectral radius of a class of non-odd-bipartite even uniform hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower bounds for the clique and the chromatic numbers of a graph
- Bounds of eigenvalues of graphs
- Bounds on eigenvalues and chromatic numbers
- An improved bound on the minimal number of edges in color-critical graphs
- The Eigenvalues of a Graph and Its Chromatic Number
