Distance-regular graphs of Hamming type
From MaRDI portal
Publication:2639878
DOI10.1016/0095-8956(90)90071-7zbMath0719.05070OpenAlexW2057174658MaRDI QIDQ2639878
Publication date: 1990
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(90)90071-7
Related Items
Quotients of association schemes ⋮ Intersection diagrams of distance-biregular graphs ⋮ A remark on Mulder's conjecture about interval-regular graphs ⋮ The subconstituent algebra of an association scheme. I ⋮ Coverings and homotopy of a graph ⋮ Almost 2-homogeneous graphs and completely regular quadrangles ⋮ Parallelogram-free distance-regular graphs having completely regular strongly regular subgraphs ⋮ Almost 2-homogeneous bipartite distance-regular graphs ⋮ An application of intersection diagrams of high rank
Cites Work
- On the nonexistence of unknown perfect 6- and 8-codes in Hamming schemes H(n,q) with q arbitrary
- A remark on the intersection arrays of distance-regular graphs
- On the nonexistence of nontrivial perfect e-codes and tight 2e-designs in Hamming schemes H(n,q) with e\(\geq 3\) and q\(\geq 3\)
- On local structure of a distance-regular graph of Hamming type
- Characterization of H(n,q) by the parameters
- On perfect codes in the Hamming schemes H(n,q) with q arbitrary
- On the uniqueness of a certain thin near octagon (or partial 2-geometry, or parallelism) derived from the binary Golay code
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
