This HTML5 document contains 45 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n9https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
n14http://commons.wikimedia.org/wiki/Special:FilePath/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Livingstone_graph
rdf:type
dbo:Software
rdfs:label
Livingstone graph
rdfs:comment
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.
dbp:name
Livingstone graph
foaf:depiction
n14:Livingstone_graph.svg
dct:subject
dbc:Regular_graphs dbc:Individual_graphs
dbo:wikiPageID
45209715
dbo:wikiPageRevisionID
1054308170
dbo:wikiPageWikiLink
dbr:Graph_theory dbr:Block_design dbr:Mathematics dbr:Simple_group dbr:Symmetric_graph dbr:Projective_linear_group dbc:Individual_graphs dbc:Regular_graphs dbr:Intersection_array dbr:Janko_group_J1 dbr:Distance-transitive_graph dbr:Sporadic_group dbr:Automorphism_group dbr:Primitive_graph
owl:sameAs
yago-res:Livingstone_graph wikidata:Q19605606 freebase:m.012ppmr8 n9:sZo6
dbp:wikiPageUsesTemplate
dbt:Reflist dbt:Combin-stub dbt:Infobox_graph
dbo:thumbnail
n14:Livingstone_graph.svg?width=300
dbp:automorphisms
175560
dbp:diameter
4
dbp:edges
1463
dbp:girth
5
dbp:properties
dbr:Distance-transitive_graph dbr:Symmetric_graph dbr:Primitive_graph
dbp:radius
4
dbp:vertices
266
dbo:abstract
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.
gold:hypernym
dbr:Graph
prov:wasDerivedFrom
wikipedia-en:Livingstone_graph?oldid=1054308170&ns=0
dbo:wikiPageLength
1762
foaf:isPrimaryTopicOf
wikipedia-en:Livingstone_graph