The following pages link to Induced subgraphs of Johnson graphs (Q444598):
Displaying 11 items.
- On the ensemble of optimal identifying codes in a twin-free graph (Q267807) (← links)
- A problem of Shapozenko on Johnson graphs (Q283683) (← links)
- The graphs G(n,k) of the Johnson schemes are unique for n\(\geq 20\) (Q762177) (← links)
- Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs (Q831858) (← links)
- On the structure of \(S_2\)-ifications of complete local rings (Q1657787) (← links)
- Distance-preserving subgraphs of Johnson graphs (Q1743174) (← links)
- Which graphs occur as \(\gamma\)-graphs? (Q2191276) (← links)
- On the ensemble of optimal dominating and locating-dominating codes in a graph (Q2346565) (← links)
- The graph \(\Delta_{2n - 1}\) is an induced subgraph of a Johnson graph (Q2907702) (← links)
- Some results on induced subgraphs of Johnson graphs (Q2909874) (← links)
- The Johnson graphs satisfy a distance extension property (Q5928573) (← links)
