A new approach to the bipartite fundamental bound (Q456660): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
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. | |||
| Property / review text: 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. / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Dragan Stevanović / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C12 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C50 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05E30 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6093932 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
distance regular graph | |||
| Property / zbMATH Keywords: distance regular graph / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
association scheme | |||
| Property / zbMATH Keywords: association scheme / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
bipartite graph | |||
| Property / zbMATH Keywords: bipartite graph / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
taut graph | |||
| Property / zbMATH Keywords: taut graph / rank | |||
Normal rank | |||
Revision as of 11:47, 30 June 2023
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
