Edge-symmetric strongly regular graphs with at most 100 vertices

DOI10.17377/SEMI.2013.10.002MaRDI QIDQ890970zbMATHFDO

Authors Marina Sefovna Nirova

Publication date 16 November 2015

Published in Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

zbMATH Keywords

strongly regular graphedge-symmetric graph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Recommendations

• On small symmetric strongly regular graphs
• Strongly regular graphs with the same parameters as the symplectic graph
• Edge-girth-regular graphs
• Strongly regular edge-transitive graphs
• scientific article; zbMATH DE number 3979110
• On the strong regularity of some edge-regular graphs
• Biregular edge-symmetric graphs
• Strongly regular graphs
• scientific article; zbMATH DE number 4035866
• scientific article; zbMATH DE number 874569

Cited in

(2)

• Strongly regular graphs with parameters \((243,66,9,21)\) is not edge symmetric
• Switching of edges in strongly regular graphs. I: A family of partial difference sets on 100 vertices

This page was built for publication: Edge-symmetric strongly regular graphs with at most 100 vertices

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