Distance-regular graph with the intersection array \56, 45, 1; 1, 9, 56\ is not vertex-symmetric

DOI10.1134/S1064562410060232MaRDI QIDQ542335zbMATH OpenFDO

Authors Alexandre A. Makhnev

Publication date 8 June 2011

Published in Doklady Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S1064562410060232

zbMATH Keywords

Gewirtz graphvertex-symmetry

Mathematics Subject Classification ID

Distance in graphs (05C12)

Recommendations

• On automorphisms of distance-regular graph with intersection array \(\{15, 12, 1; 1, 2, 15\}\)
• On small symmetric strongly regular graphs
• Automorphisms of graphs with intersection arrays \(\{60, 45, 8; 1, 12, 50\}\) and \(\{49, 36, 8; 1, 6, 42\}\)
• On automorphisms of distance-regular graph with intersection array \(\{19,16,8;1,2,8\}\)
• A distance-regular graph with the intersection array \(\{8, 7, 5; 1, 1, 4\}\) and its automorphisms

Cites work

• Characterization of simple \(K_4\)-groups.
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• On graphs in which the neighborhood of each vertex is isomorphic to the Gewirtz graph

Cited in

(6)

• On small symmetric strongly regular graphs
• On automorphisms of distance-regular graph with intersection array \(\{15, 12, 1; 1, 2, 15\}\)
• Association schemes on 28 points as mergings of a half-homogeneous coherent configuration
• Generalized quadrangle \(\mathrm{GQ}(4, 16)\) and its extensions
• On automorphisms of strongly regular locally cyclic graphs
• On a graph isomorphic to \(NO^+(6,2)\)

This page was built for publication: Distance-regular graph with the intersection array \(\{56, 45, 1; 1, 9, 56\}\) is not vertex-symmetric

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q542335)