On strongly closed subgraphs of highly regular graphs
From MaRDI portal
Publication:1891370
DOI10.1016/0195-6698(95)90059-4zbMath0821.05020OpenAlexW2001537331MaRDI QIDQ1891370
Publication date: 12 September 1995
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0195-6698(95)90059-4
distance-regular graphsstrongly closed subgraphsdistance-biregular graphsgeodetically closed induced subgraphhighly regular graphs
Related Items (19)
A distance-regular graph with bipartite geodetically closed subgraphs. ⋮ On strongly closed subgraphs with diameter two and the \(Q\)-polynomial property ⋮ A characterization of the Hamming graphs and the dual polar graphs by completely regular subgraphs ⋮ Subspaces in \(d\)-bounded distance-regular graphs and their applications ⋮ Erdős-Ko-Rado theorems in certain semilattices ⋮ 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 ⋮ 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 ⋮ Strongly closed subgraphs in a distance-regular graph with \(c_{2} > 1\) ⋮ A characterization of some distance-regular graphs by strongly closed subgraphs ⋮ Distance-regular graph with \(c_{2} > 1\) and \(a_{1} = 0 < a_{2}\) ⋮ Parallelogram-free distance-regular graphs having completely regular strongly regular subgraphs ⋮ Classical distance-regular graphs of negative type ⋮ A characterization of the doubled Grassmann graphs, the doubled Odd graphs, and the Odd graphs by strongly closed subgraphs ⋮ A distance-regular graph with strongly closed subgraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On generalized Moore geometries. I, II
- On subgraphs in distance-regular graphs
- Distance-biregular graphs with 2-valent vertices and distance regular line graphs
- A remark on the intersection arrays of distance-regular graphs
- On 2-transitive graphs of girth 5
- Characterization of the association schemes of Hermitian forms over \(GF(2^ 2)\)
- On finite Moore geometries
- How many P-polynomial structures can an association scheme have?
- Bipartite distance-regular graphs of valency three
- Bounding the diameter of a distance regular graph by a function of \(k_ d\)
- The dual of Pasch's axiom
- A new condition for distance-regular graphs
- Characterization of projective incidence structures
- On uniformly geodetic graphs
- A circuit chasing technique in a distance-regular graph with triangles
- On distance-biregular graphs of girth divisible by four
- An improvement of the Boshier-Nomura bound
- Distance biregular bipartite graphs
- Distance-regular graphs of valency 6 and \(a_1=1\)
- Distance-regularised graphs are distance-regular or distance-biregular
- Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I
- Distance-regular graphs and (s,c,a,k)-graphs
- A note on association schemes with two \(\text{P}\)-polynomial structures of type III
- Intersection diagrams of distance-biregular graphs
- Cubic Distance-Regular Graphs
- On Moore Geometries, I
- On Moore geometries. II
- The nonexistence of Moore geometries of diameter 4
This page was built for publication: On strongly closed subgraphs of highly regular graphs
