About: Holt graph

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

Graph with 27 vertices and 54 edges, the smallest half-transitive graph

Property Value
dbo:description
  • a legkisebb féltranzitív gráf (hu)
  • graph with 27 vertices and 54 edges, the smallest half-transitive graph (en)
  • наименьший полу-транзитивный граф (ru)
dbo:thumbnail
dbo:wikiPageWikiLink
dbp:automorphisms
  • 54 (xsd:integer)
dbp:bookThickness
  • 3 (xsd:integer)
dbp:chromaticIndex
  • 5 (xsd:integer)
dbp:chromaticNumber
  • 3 (xsd:integer)
dbp:diameter
  • 3 (xsd:integer)
dbp:edges
  • 54 (xsd:integer)
dbp:girth
  • 5 (xsd:integer)
dbp:imageCaption
  • In the Holt graph, all vertices are equivalent, and all edges are equivalent, but edges are not equivalent to their inverses. (en)
dbp:name
  • Holt graph (en)
dbp:namesake
  • Derek F. Holt (en)
dbp:properties
dbp:queueNumber
  • 3 (xsd:integer)
dbp:radius
  • 3 (xsd:integer)
dbp:vertices
  • 27 (xsd:integer)
dbp:wikiPageUsesTemplate
dct:subject
rdfs:label
  • Holt graph (en)
  • Graphe de Doyle (fr)
  • Grafo de Holt (pt)
  • Граф Холта (ru)
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 4.0 International