McLaughlin graph

E1713576 UNEXPLORED

The McLaughlin graph is a highly symmetric, strongly regular graph with 275 vertices that encodes the combinatorial structure on which the sporadic McLaughlin simple group acts as an automorphism group.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
McLaughlin graph canonical	2

Referenced by (2)

Full triples — surface form annotated when it differs from this entity's canonical label.

McLaughlin group → hasRelatedGeometry → McLaughlin graph ⓘ

McLaughlin group → actsOn → McLaughlin graph ⓘ