Bounds on eigenvalues and chromatic numbers

From MaRDI portal
Publication:1377497

DOI10.1016/S0024-3795(96)00199-1zbMath0894.05041MaRDI QIDQ1377497

Dasong Cao

Publication date: 7 September 1998

Published in: Linear Algebra and its Applications (Search for Journal in Brave)




Related Items

A new upper bound for the spectral radius of graphs with girth at least 5On generalized inverse sum indeg index and energy of graphsUnnamed ItemUpper bounds on the spectral radius of book-free and/or \(K_{2,l}\)-free graphsBounds on graph eigenvalues. ISpectral radii of graphs with given chromatic numberBounds on the (Laplacian) spectral radius of graphsA bound on the spectral radius of graphs in terms of their Zagreb indicesA note on Laplacian graph eigenvaluesOn the Laplacian eigenvalues of a graphSome upper bounds for the energy of graphsTwo sharp upper bounds for the Laplacian eigenvalues.Sharp bounds for the spectral radius of nonnegative matricesOn the spectral radius of graphsAn inequality for the group chromatic number of a graphUpper bounds for \(H\)- and \(Z\)-spectral radii of uniform hypergraphsSchur complements and its applications to symmetric nonnegative and \(Z\)-matricesSharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of treesUnnamed ItemOn an upper bound of the spectral radius of graphsThe least eigenvalue of graphs with given connectivityOn the maximum spectral radius of multipartite graphsBounds for the spectral radius and energy of extended adjacency matrix of graphsA sharp upper bound for the spectral radius of a nonnegative matrix and applicationsColorings in digraphs from the spectral radiusNordhaus-Gaddum-type relations for arithmetic-geometric spectral radius and energyUnnamed ItemSpectral radius of non-negative matrices and digraphs



Cites Work


This page was built for publication: Bounds on eigenvalues and chromatic numbers