Hoffman bound in graph theory

E1243904 UNEXPLORED

The Hoffman bound in graph theory is a spectral bound that uses the eigenvalues of a graph’s adjacency matrix to give an upper limit on the size of its maximum independent set (and related parameters like the chromatic number).

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
Hoffman bound in graph theory canonical	1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Alan Hoffman → notableConcept → Hoffman bound in graph theory ⓘ