More spectral bounds on the clique and independence numbers
Vladimir Nikiforov
TL;DR
This paper introduces new spectral bounds for the clique and independence numbers of graphs, enhancing the understanding of how eigenvalues influence these graph invariants.
Contribution
It provides novel bounds relating eigenvalues to clique and independence numbers, advancing spectral graph theory.
Findings
New bounds for clique numbers based on eigenvalues
New bounds for independence numbers based on eigenvalues
Improved understanding of spectral properties in graph theory
Abstract
We give some new bounds for the clique and independence numbers of a graph in terms of its eigenvalues.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Limits and Structures in Graph Theory · Finite Group Theory Research