Sylvester graph
id:
sylvester-graph-312-12946781
title:
Sylvester graph
text:
The Sylvester graph is the unique distance-regular graph
with intersection array { 5 , 4 , 2 ; 1 , 1 , 4 } .
It is a subgraph of the Hoffman–Singleton graph.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Sylvester_graph
date created:
date modified:
2024-04-22T00:29:29Z
main entity:
{"identifier":"Q3115536","url":"https://www.wikidata.org/entity/Q3115536"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/8/89/Sylvester_graph.svg","width":525,"height":525}
fields total:
13
integrity:
14