D-bounded distance-regular graphs
From MaRDI portal
Publication:674630
DOI10.1006/EUJC.1995.0083zbMATH Open0869.05025OpenAlexW2093535138MaRDI QIDQ674630FDOQ674630
Authors: Chih-Wen Weng 
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
Recommendations
- Weak-geodetically closed subgraphs in distance-regular graphs
- Nonexistence of a class of distance-regular graphs
- A construction of distance-regular graphs from subspaces in \(d\)-bounded distance-regular graphs.
- Some inequalities in distance-regular graphs
- Diameter bounds for geometric distance-regular graphs
Cited In (29)
- Lattices generated by join of strongly closed subgraphs in \(d\)-bounded distance-regular graphs
- Classical distance-regular graphs of negative type
- Edge-distance-regular graphs are distance-regular
- Erdős-Ko-Rado theorems in certain semilattices
- Two new error-correcting pooling designs from \(d\)-bounded distance-regular graphs
- Pooling spaces associated with finite geometry
- Dual polar spaces as extremal distance-regular graphs.
- A note on triangle-free distance-regular graphs with \(a_2\neq 0\)
- Two results concerning distance-regular directed graphs
- Distance regular graphs arising from dimensional dual hyperovals
- A new family of distance-regular graphs with unbounded diameter
- Pooling spaces and non-adaptive pooling designs
- An inequality for regular near polygons
- Subspaces in \(d\)-bounded distance-regular graphs and their applications
- Further study of distance-regular graphs with classical parameters with \(b < -1\)
- Strongly closed subgraphs in a distance-regular graph with \(c_{2} > 1\)
- A characterization of some distance-regular graphs by strongly closed subgraphs
- Lattices generated by strongly closed subgraphs in \(d\)-bounded distance-regular graphs
- On strongly closed subgraphs with diameter two and the \(Q\)-polynomial property
- Distance-regular graphs and \((\alpha,\beta)\)-geometries
- Bounding the intersection number \(c_2\) of a distance-regular graph with classical parameters \((D, b, \alpha, \beta)\) in terms of \(b\)
- Scaling limits for the Gibbs states on distance-regular graphs with classical parameters
- Nonexistence of a class of distance-regular graphs
- 3-bounded property in a triangle-free distance-regular graph
- Posets associated with subspaces in a \(d\)-bounded distance-regular graph
- Distance-regular graph with \(c_{2} > 1\) and \(a_{1} = 0 < a_{2}\)
- Lattices generated by subspaces in \(d\)-bounded distance-regular graphs
- A characterization of the Hamming graph by strongly closed subgraphs
- On \(Q\)-polynomial regular near \(2d\)-gons
This page was built for publication: \(D\)-bounded distance-regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q674630)
