Classical distance-regular graphs of negative type
From MaRDI portal
Publication:1305525
DOI10.1006/jctb.1998.1892zbMath0938.05067OpenAlexW2144376150MaRDI QIDQ1305525
Publication date: 21 June 2000
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1998.1892
Related Items (23)
Lattices generated by strongly closed subgraphs in \(d\)-bounded distance-regular graphs ⋮ On strongly closed subgraphs with diameter two and the \(Q\)-polynomial property ⋮ Bipartite \(Q\)-polynomial distance-regular graphs and uniform posets ⋮ Restrictions on classical distance-regular graphs ⋮ Distance-regular graphs with classical parameters that support a uniform structure: case \(q \leq 1\) ⋮ Subspaces in \(d\)-bounded distance-regular graphs and their applications ⋮ Further study of distance-regular graphs with classical parameters with \(b < -1\) ⋮ A Higman inequality for regular near polygons ⋮ Erdős-Ko-Rado theorems in certain semilattices ⋮ Dual polar spaces as extremal distance-regular graphs. ⋮ Nonexistence of a class of distance-regular graphs ⋮ 3-bounded property in a triangle-free distance-regular graph ⋮ Triangle-free distance-regular graphs ⋮ Lattices generated by join of strongly closed subgraphs in \(d\)-bounded distance-regular graphs ⋮ Posets associated with subspaces in a \(d\)-bounded distance-regular graph ⋮ Two new error-correcting pooling designs from \(d\)-bounded distance-regular graphs ⋮ A note on triangle-free distance-regular graphs with \(a_2\neq 0\) ⋮ Lattices generated by subspaces in \(d\)-bounded distance-regular graphs ⋮ A characterization of some distance-regular graphs by strongly closed subgraphs ⋮ Scaling limits for the Gibbs states on distance-regular graphs with classical parameters ⋮ Distance-regular graph with \(c_{2} > 1\) and \(a_{1} = 0 < a_{2}\) ⋮ An equitable partition for a distance-regular graph of negative type ⋮ Thin \(Q\)-polynomial distance-regular graphs have bounded \(c_2\)
Cites Work
- Unnamed Item
- Unnamed Item
- \(D\)-bounded distance-regular graphs
- The subconstituent algebra of an association scheme. I
- The association schemes of dual polar spaces of type \(^ 2A_{2d- 1}(p^ f)\) are characterized by their parameters if \(d\geq 3\)
- Characterization of the association schemes of Hermitian forms over \(GF(2^ 2)\)
- The graphs with spectral radius between 2 and \(\sqrt{2+\sqrt{5}}\)
- A characterization of the association schemes of Hermitian forms
- Weak-geodetically closed subgraphs in distance-regular graphs
- A new inequality for distance-regular graphs
- On strongly closed subgraphs of highly regular graphs
- Kite-free distance-regular graphs
This page was built for publication: Classical distance-regular graphs of negative type
