A new approach to the bipartite fundamental bound (Q456660): Difference between revisions
From MaRDI portal
Latest revision as of 18:12, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new approach to the bipartite fundamental bound |
scientific article |
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
