[go: up one dir, main page]

About: Antiprism graph

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

In the mathematical field of graph theory, an antiprism graph is a graph that has one of the antiprisms as its skeleton. An n-sided antiprism has 2n vertices and 4n edges. They are regular, polyhedral (and therefore by necessity also 3-vertex-connected, vertex-transitive, and planar graphs), and also Hamiltonian graphs.

thumbnail
Property Value
dbo:abstract
  • In the mathematical field of graph theory, an antiprism graph is a graph that has one of the antiprisms as its skeleton. An n-sided antiprism has 2n vertices and 4n edges. They are regular, polyhedral (and therefore by necessity also 3-vertex-connected, vertex-transitive, and planar graphs), and also Hamiltonian graphs. (en)
dbo:thumbnail
dbo:wikiPageID
  • 45012210 (xsd:integer)
dbo:wikiPageLength
  • 2469 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1093472983 (xsd:integer)
dbo:wikiPageWikiLink
dbp:title
  • Antiprism graph (en)
dbp:urlname
  • AntiprismGraph (en)
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • In the mathematical field of graph theory, an antiprism graph is a graph that has one of the antiprisms as its skeleton. An n-sided antiprism has 2n vertices and 4n edges. They are regular, polyhedral (and therefore by necessity also 3-vertex-connected, vertex-transitive, and planar graphs), and also Hamiltonian graphs. (en)
rdfs:label
  • Antiprism graph (en)
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
foaf:isPrimaryTopicOf
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 3.0 Unported License