Spectral characterizations of the Lovász number and the Delsarte number of a graph

DOI10.1023/A:1026587926110zbMath0960.05066OpenAlexW40462281MaRDI QIDQ1592957

A. Galtman

Publication date: 10 May 2001

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1026587926110

zbMATH Keywords

theta functionindependence numbergraph LaplacianLovász numberDelsarte linear programming bound

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

Vector coloring the categorical product of graphs ⋮ Spectral bounds for the independence ratio and the chromatic number of an operator ⋮ An axiomatic duality framework for the theta body and related convex corners ⋮ More tales of Hoffman: bounds for the vector chromatic number of a graph

Cites Work

• Geometric algorithms and combinatorial optimization.
• The sandwich theorem
• A comparison of the Delsarte and Lovász bounds
• Cones of Matrices and Set-Functions and 0–1 Optimization
• On the Shannon capacity of a graph
• Unnamed Item
• Unnamed Item

This page was built for publication: Spectral characterizations of the Lovász number and the Delsarte number of a graph