Pages that link to "Item:Q1891370"
From MaRDI portal
The following pages link to On strongly closed subgraphs of highly regular graphs (Q1891370):
Displaying 19 items.
- Two new error-correcting pooling designs from \(d\)-bounded distance-regular graphs (Q732327) (← links)
- On strongly closed subgraphs with diameter two and the \(Q\)-polynomial property (Q854818) (← links)
- A characterization of the Hamming graph by strongly closed subgraphs (Q942131) (← links)
- 3-bounded property in a triangle-free distance-regular graph (Q942133) (← links)
- Lattices generated by join of strongly closed subgraphs in \(d\)-bounded distance-regular graphs (Q952653) (← links)
- Posets associated with subspaces in a \(d\)-bounded distance-regular graph (Q965945) (← links)
- Strongly closed subgraphs in a distance-regular graph with \(c_{2} > 1\) (Q1015439) (← links)
- A characterization of some distance-regular graphs by strongly closed subgraphs (Q1024283) (← links)
- Distance-regular graph with \(c_{2} > 1\) and \(a_{1} = 0 < a_{2}\) (Q1043794) (← links)
- Parallelogram-free distance-regular graphs having completely regular strongly regular subgraphs (Q1043847) (← links)
- Classical distance-regular graphs of negative type (Q1305525) (← links)
- A distance-regular graph with strongly closed subgraphs (Q1610682) (← links)
- A characterization of the doubled Grassmann graphs, the doubled Odd graphs, and the Odd graphs by strongly closed subgraphs (Q1867281) (← links)
- A distance-regular graph with bipartite geodetically closed subgraphs. (Q1873771) (← links)
- A characterization of the Hamming graphs and the dual polar graphs by completely regular subgraphs (Q1926034) (← links)
- Subspaces in \(d\)-bounded distance-regular graphs and their applications (Q2426435) (← links)
- Erdős-Ko-Rado theorems in certain semilattices (Q2441154) (← links)
- A note on triangle-free distance-regular graphs with \(a_2\neq 0\) (Q2519028) (← links)
- Lattices generated by subspaces in \(d\)-bounded distance-regular graphs (Q2519838) (← links)