Two infinite classes of perfect codes in metrically regular graphs
From MaRDI portal
Publication:1223320
DOI10.1016/0095-8956(77)90035-1zbMath0322.05148OpenAlexW1966764213MaRDI QIDQ1223320
Publication date: 1977
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(77)90035-1
Finite affine and projective planes (geometric aspects) (51E15) Combinatorial aspects of finite geometries (05B25) Graph theory (05C99)
Related Items
\(m\)-systems of polar spaces, Covers of complete graphs and related association schemes, Polar spaces, generalized hexagons and perfect codes, On perfect codes in Cartesian products of graphs, New families of completely regular codes and their corresponding distance regular coset graphs, The non-existence of ovoids in the dual polar space DW(5, \(q\)), Doubly transitive lines. I: Higman pairs and roux, On maximal partial spreads of \(H(2n+1,q^{2}\)), Distance regular covers of the complete graph, q-coverings, codes and line graphs, Unnamed Item, Antidesigns and regularity of partial spreads in dual polar graphs, Spreads, Translation Planes and Kerdock Sets. I
Cites Work
