On a Family of Diamond-Free Strongly Regular Graphs

DOI10.1137/130925293zbMath1314.05233arXiv1303.0473OpenAlexW2050043451MaRDI QIDQ5246091

B. Tayfeh-Rezaie, Ali Mohammadian

Publication date: 17 April 2015

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1303.0473

zbMATH Keywords

automorphism groupstrongly regular graphadjacency matrixpartial quadrangletransitive graphdiamond-free grapheigenvalue multiplicitynegative Latin square graph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Combinatorial aspects of finite geometries (05B25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

This page was built for publication: On a Family of Diamond-Free Strongly Regular Graphs