On strongly closed subgraphs of highly regular graphs
From MaRDI portal
Recommendations
- The existence of strongly closed subgraphs in highly regular graphs
- On highly regular strongly regular graphs
- Strongly closed subgraphs in a distance-regular graph with \(c_{2} > 1\)
- Strongly closed subgraphs in a regular thick near polygon
- A distance-regular graph with strongly closed subgraphs
- scientific article; zbMATH DE number 3979110
- A characterization of some distance-regular graphs by strongly closed subgraphs
- An application of a construction theory of strongly closed subgraphs in a distance-regular graph
- A generalization of strongly regular graphs
- Distance-regular graphs with strongly regular subconstituents
Cites work
- A circuit chasing technique in a distance-regular graph with triangles
- A new condition for distance-regular graphs
- A note on association schemes with two \(\text{P}\)-polynomial structures of type III
- A remark on the intersection arrays of distance-regular graphs
- An improvement of the Boshier-Nomura bound
- Bipartite distance-regular graphs of valency three
- Bounding the diameter of a distance regular graph by a function of \(k_ d\)
- Characterization of projective incidence structures
- Characterization of the association schemes of Hermitian forms over GF(2^ 2)
- Cubic Distance-Regular Graphs
- Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I
- Distance biregular bipartite graphs
- Distance-biregular graphs with 2-valent vertices and distance regular line graphs
- Distance-regular graphs and (s,c,a,k)-graphs
- Distance-regular graphs of valency 6 and a₁=1
- Distance-regularised graphs are distance-regular or distance-biregular
- How many P-polynomial structures can an association scheme have?
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 3890251 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 91426 (Why is no real title available?)
- Intersection diagrams of distance-biregular graphs
- On 2-transitive graphs of girth 5
- On distance-biregular graphs of girth divisible by four
- On finite Moore geometries
- On generalized Moore geometries. I, II
- On Moore Geometries, I
- On Moore geometries. II
- On subgraphs in distance-regular graphs
- On uniformly geodetic graphs
- The dual of Pasch's axiom
- The nonexistence of Moore geometries of diameter 4
Cited in
(20)- 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
- An application of a construction theory of strongly closed subgraphs in a distance-regular graph
- Classical distance-regular graphs of negative type
- A distance-regular graph with strongly closed subgraphs
- A characterization of the doubled Grassmann graphs, the doubled Odd graphs, and the Odd graphs by strongly closed subgraphs
- A distance-regular graph with bipartite geodetically closed subgraphs.
- 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 note on triangle-free distance-regular graphs with \(a_2\neq 0\)
- Lattices generated by subspaces in d-bounded distance-regular graphs
- Two new error-correcting pooling designs from d-bounded distance-regular graphs
- On strongly closed subgraphs with diameter two and the Q-polynomial property
- 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
This page was built for publication: On strongly closed subgraphs of highly regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1891370)
