Distance-regular graphs of Hamming type (Q2639878): Difference between revisions

An H(e,\(\lambda\),k)-graph is defined to be a distance-regular graph with the following intersection array \[ \left\{\begin{matrix} 0 & 1 & 2 &... & e-1 & e & *...* \\ 0 & \lambda & 2\lambda & ... & (e-1)\lambda & * & *...* & \\ k & * & * & ... & * & * & *...* \end{matrix}\right\} \] where * takes an arbitrary value under the restriction that each column sum is k. Theorem. Let \(\Gamma\) be an \(H(3,\lambda,k)\)-graph (\(\lambda\neq 2)\). Then there exists a covering \(\theta: H(n,q)\to \Gamma\), where \(H(n,q)\) denotes the Hamming graph and \(q=\lambda +2\), \(n=k/(\lambda +1).\) Corollary. Let \(\Gamma\) be an \(H(d,\lambda,k)\)-graph with diameter d, \(d\geq 3\), \(\lambda\neq 0,2\). Then \(\Gamma\) is isomorphic to \(H(n,q)\) with \(q=\lambda +2,n=k/(\lambda +1)\).