A new approach to the bipartite fundamental bound (Q456660): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(6 intermediate revisions by 5 users not shown) | |||
Property / author | |||
Property / author: Mark S. MacLean / rank | |||
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 | |||
Property / author | |||
Property / author: Mark S. MacLean / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.disc.2012.07.014 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2006363510 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3218140 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3992965 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: 2-homogeneous bipartite distance-regular graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Problems in algebraic combinatorics / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tight distance-regular graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An inequality involving two eigenvalues of a bipartite distance-regular graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Taut distance-regular graphs of odd diameter / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Taut distance-regular graphs and the subconstituent algebra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The subconstituent algebra of a bipartite distance-regular graph; thin modules with endpoint two / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Homogeneous graphs and regular near polygons / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
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