Strongly regular graphs that are locally a disjoint union of hexagons

DOI10.1006/eujc.1996.0126zbMath0881.05121OpenAlexW2096239921MaRDI QIDQ1363002

René Peeters

Publication date: 16 February 1998

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://pure.uvt.nl/ws/files/1108024/STRONGLY.PDF

zbMATH Keywords

strongly regular graphhexagonspoint graph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items (3)

Uniqueness of strongly regular graphs having minimal \(p\)-rank ⋮ The pseudo-geometric graphs for generalized quadrangles of order \((3,t)\) ⋮ Strongly regular tri-Cayley graphs

This page was built for publication: Strongly regular graphs that are locally a disjoint union of hexagons