\(D\)-bounded distance-regular graphs
From MaRDI portal
Publication:674630
DOI10.1006/eujc.1995.0083zbMath0869.05025OpenAlexW2093535138MaRDI QIDQ674630
Publication date: 31 August 1997
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/eujc.1995.0083
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 ⋮ Subspaces in \(d\)-bounded distance-regular graphs and their applications ⋮ Further study of distance-regular graphs with classical parameters with \(b < -1\) ⋮ Erdős-Ko-Rado theorems in certain semilattices ⋮ Dual polar spaces as extremal distance-regular graphs. ⋮ Pooling spaces associated with finite geometry ⋮ Nonexistence of a class of distance-regular graphs ⋮ A characterization of the Hamming graph by strongly closed subgraphs ⋮ 3-bounded property in a triangle-free distance-regular graph ⋮ Lattices generated by join of strongly closed subgraphs in \(d\)-bounded distance-regular graphs ⋮ On \(Q\)-polynomial regular near \(2d\)-gons ⋮ Posets associated with subspaces in a \(d\)-bounded distance-regular graph ⋮ An inequality for regular near polygons ⋮ 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 ⋮ Strongly closed subgraphs in a distance-regular graph with \(c_{2} > 1\) ⋮ A characterization of some distance-regular graphs by strongly closed subgraphs ⋮ Scaling limits for the Gibbs states on distance-regular graphs with classical parameters ⋮ Pooling spaces and non-adaptive pooling designs ⋮ Distance-regular graph with \(c_{2} > 1\) and \(a_{1} = 0 < a_{2}\) ⋮ Classical distance-regular graphs of negative type
This page was built for publication: \(D\)-bounded distance-regular graphs
