Automorphisms of a graph with intersection array \(\{115,96,30,1;1,10,96,115\}\)

DOI10.1134/S1064562414060131zbMath1331.05105MaRDI QIDQ2353020

M. S. Samoilenko, Dmitriĭ Viktorovich Paduchikh, Aleksandr Alekseevich Makhnev

Publication date: 7 July 2015

Published in: Doklady Mathematics (Search for Journal in Brave)

zbMATH Keywords

distance-regular graphstrongly regular graphintersection arrayautomorphism of graph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

On automorphisms of a distance-regular graph with intersection array \(\{96,76,1;1,19,96\}\) ⋮ On automorphisms of a distance-regular graph with intersection array $\{69, 56, 10; 1, 14, 60\}$

Cites Work

• On graphs whose local subgraphs are strongly regular with parameters \((115, 18, 1, 3)\)
• The Gewirtz graph: An exercise in the theory of graph spectra
• Unnamed Item

This page was built for publication: Automorphisms of a graph with intersection array \(\{115,96,30,1;1,10,96,115\}\)