A sharp upper bound for the spectral radius of the Nordhaus-Gaddum type

DOI10.1016/S0012-365X(99)90280-7zbMath0952.05045OpenAlexW2024841505MaRDI QIDQ1969793

Jin-Long Shu, Yuan Hong

Publication date: 27 July 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)90280-7

zbMATH Keywords

eigenvalueupper boundchromatic number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15)

Related Items (12)

The Laplacian spread of graphs ⋮ Eigenvalue problems of Nordhaus--Gaddum type ⋮ Some Nordhaus-Gaddum type results of \(A_\alpha \)-eigenvalues of weighted graphs ⋮ Generalizations of some Nordhaus–Gaddum‐type results on spectral radius ⋮ On the spectral radii and principal eigenvectors of uniform hypergraphs ⋮ New Nordhaus-Gaddum-type results for the Kirchhoff index ⋮ Nordhaus-Gaddum results for the convex domination number of a graph ⋮ Distance Laplacian eigenvalues and chromatic number in graphs ⋮ Nordhaus-Gaddum-type results for path covering and \(L(2,1)\)-labeling numbers ⋮ Nordhaus-Gaddum relations for proximity and remoteness in graphs ⋮ Ramsey games with giants ⋮ Open problems on graph eigenvalues studied with AutoGraphiX

This page was built for publication: A sharp upper bound for the spectral radius of the Nordhaus-Gaddum type