A new approach to the bipartite fundamental bound (Q456660)
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 6093932
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new approach to the bipartite fundamental bound |
scientific article; zbMATH DE number 6093932 |
Statements
A new approach to the bipartite fundamental bound (English)
0 references
16 October 2012
0 references
The author defined taut graphs as bipartite distance regular graphs that satisfy an inequality proved in [\textit{M. S. MacLean}, Discrete Math 225, No. 1--3, 193--216 (2000; Zbl 1001.05124)]. Here the author gives a new linear-algebraic characterization of taut graphs.
0 references
distance regular graph
0 references
association scheme
0 references
bipartite graph
0 references
taut graph
0 references
0 references
0.8063532710075378
0 references
0.7843576073646545
0 references
0.7446978092193604
0 references
0.743541419506073
0 references
0.7345383763313293
0 references
