Spectral characterizations of the Lovász number and the Delsarte number of a graph
type: Item
instance of: scholarly article
title: Spectral characterizations of the Lovász number and the Delsarte number of a graph
zbMATH Open document ID: 0960.05066
DOI: 10.1023/A:1026587926110
author: A. Galtman
published in: Journal of Algebraic Combinatorics
publication date: 2001-05-10T00:00:00Z
review text: Spectral characterizations of two closely related graph functions are given: the Lovász number (the theta function) \(\vartheta \) and a generalization \(\vartheta^1\) of Delsarte's linear programming bound. These characterizations involve the largest eigenvalue of a type of weighted Laplacian that \textit{F. R. K. Chung} introduced in her book [Spectral graph theory (Regional Conference Series in Mathematics. 92, Providence, RI: American Mathematical Society) (1997; Zbl 0867.05046)].
reviewed by: Ján Plesník
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 1553308
zbMATH Keywords: graph Laplacian
zbMATH Keywords: independence number
zbMATH Keywords: Lovász number
zbMATH Keywords: theta function
zbMATH Keywords: Delsarte linear programming bound
MaRDI profile type: Publication
cites work: Geometric algorithms and combinatorial optimization.
cites work: Q4129487
cites work: The sandwich theorem
cites work: On the Shannon capacity of a graph
cites work: Cones of Matrices and Set-Functions and 0–1 Optimization
cites work: Q4194987
cites work: A comparison of the Delsarte and Lovász bounds
full work available at URL: a:1026587926110
OpenAlex ID: W40462281
description: scientific article; zbMATH DE number 1553308