Pages that link to "Item:Q762177"
From MaRDI portal
The following pages link to The graphs G(n,k) of the Johnson schemes are unique for n\(\geq 20\) (Q762177):
Displaying 16 items.
- A problem of Shapozenko on Johnson graphs (Q283683) (← links)
- Binary codes and partial permutation decoding sets from the Johnson graphs (Q497331) (← links)
- Hamiltonian uniform subset graphs (Q1071032) (← links)
- The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\) (Q1072567) (← links)
- A local characterization of the Johnson scheme (Q1107538) (← links)
- Covering projections of graphs preserving links of vertices and edges (Q1339869) (← links)
- Characterization of the folded Johnson graphs of small diameter by their intersection arrays (Q1372622) (← links)
- Cospectral mates for the union of some classes in the Johnson association scheme (Q1688881) (← links)
- Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I (Q1825881) (← links)
- A classification of the strongly regular generalised Johnson graphs (Q1928568) (← links)
- Resolving sets for Johnson and Kneser graphs (Q1940362) (← links)
- On the girth and diameter of generalized Johnson graphs (Q2411607) (← links)
- The graph \(\Delta_{2n - 1}\) is an induced subgraph of a Johnson graph (Q2907702) (← links)
- An infinite family of incidence geometries whose incidence graphs are locally X (Q5041808) (← links)
- On the characterization of the folded Johnson graphs and the folded halved cubes by their intersection arrays (Q5961463) (← links)
- Asymptotically sharpening the $s$-Hamiltonian index bound (Q6041429) (← links)
