A new approach to the bipartite fundamental bound
From MaRDI portal
(Redirected from Publication:456660)
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.
Recommendations
- Taut distance-regular graphs and the subconstituent algebra
- A new characterization of taut distance-regular graphs of odd diameter
- Bipartite distance-regular graphs and taut pairs of pseudo primitive idempotents
- Taut distance-regular graphs of even diameter
- Taut distance-regular graphs of odd diameter
Cites work
- 2-homogeneous bipartite distance-regular graphs
- An inequality involving two eigenvalues of a bipartite distance-regular graph
- Homogeneous graphs and regular near polygons
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- Problems in algebraic combinatorics
- Taut distance-regular graphs and the subconstituent algebra
- Taut distance-regular graphs of odd diameter
- The subconstituent algebra of a bipartite distance-regular graph; thin modules with endpoint two
- Tight distance-regular graphs
Cited in
(2)
This page was built for publication: A new approach to the bipartite fundamental bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456660)