Spectral characterizations of the Lovász number and the Delsarte number of a graph (Q1592957)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1553308
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Spectral characterizations of the Lovász number and the Delsarte number of a graph |
scientific article; zbMATH DE number 1553308 |
Statements
Spectral characterizations of the Lovász number and the Delsarte number of a graph (English)
0 references
10 May 2001
0 references
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)].
0 references
graph Laplacian
0 references
independence number
0 references
Lovász number
0 references
theta function
0 references
Delsarte linear programming bound
0 references
0.7983813285827637
0 references
0.7796297073364258
0 references
0.7726845145225525
0 references
