In the mathematical field of graph theory, the Livingstone graph is a distance-transitive graph with 266 vertices and 1463 edges. Its intersection array is {11,10,6,1;1,1,5,11}. It is the largest distance-transitive graph with degree 11.
Attributes | Values |
---|---|
rdf:type | |
rdfs:label |
|
rdfs:comment |
|
name |
|
foaf:depiction | |
dct:subject | |
Wikipage page ID |
|
Wikipage revision ID |
|
Link from a Wikipage to another Wikipage | |
sameAs | |
dbp:wikiPageUsesTemplate | |
thumbnail | |
automorphisms |
|
diameter |
|
edges |
|
girth |
|
properties | |
radius |
|
vertices |
|
has abstract |
|
gold:hypernym | |
prov:wasDerivedFrom | |
page length (characters) of wiki page |
|
foaf:isPrimaryTopicOf | |
is Link from a Wikipage to another Wikipage of | |
is foaf:primaryTopic of |