About: Platonic graph

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

In the mathematical field of graph theory, a Platonic graph is a graph that has one of the Platonic solids as its skeleton. There are 5 Platonic graphs, and all of them are regular, polyhedral (and therefore by necessity also 3-vertex-connected, vertex-transitive, edge-transitive and planar graphs), and also Hamiltonian graphs. * Tetrahedral graph – 4 vertices, 6 edges * Octahedral graph – 6 vertices, 12 edges * Cubical graph – 8 vertices, 12 edges * Icosahedral graph – 12 vertices, 30 edges * Dodecahedral graph – 20 vertices, 30 edges

thumbnail
Property Value
dbo:abstract
  • In the mathematical field of graph theory, a Platonic graph is a graph that has one of the Platonic solids as its skeleton. There are 5 Platonic graphs, and all of them are regular, polyhedral (and therefore by necessity also 3-vertex-connected, vertex-transitive, edge-transitive and planar graphs), and also Hamiltonian graphs. * Tetrahedral graph – 4 vertices, 6 edges * Octahedral graph – 6 vertices, 12 edges * Cubical graph – 8 vertices, 12 edges * Icosahedral graph – 12 vertices, 30 edges * Dodecahedral graph – 20 vertices, 30 edges (en)
  • Graf platoński – graf, którego wierzchołki i krawędzie są wierzchołkami i krawędziami wielościanu foremnego (bryły platońskiej). Graf platoński stanowi graf planarny utworzony w wyniku rzutu środkowego wierzchołków oraz krawędzi wielościanu foremnego na płaszczyznę. (pl)
dbo:thumbnail
dbo:wikiPageID
  • 45009601 (xsd:integer)
dbo:wikiPageLength
  • 1810 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1093472702 (xsd:integer)
dbo:wikiPageWikiLink
dbp:title
  • Platonic graph (en)
dbp:urlname
  • PlatonicGraph (en)
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • In the mathematical field of graph theory, a Platonic graph is a graph that has one of the Platonic solids as its skeleton. There are 5 Platonic graphs, and all of them are regular, polyhedral (and therefore by necessity also 3-vertex-connected, vertex-transitive, edge-transitive and planar graphs), and also Hamiltonian graphs. * Tetrahedral graph – 4 vertices, 6 edges * Octahedral graph – 6 vertices, 12 edges * Cubical graph – 8 vertices, 12 edges * Icosahedral graph – 12 vertices, 30 edges * Dodecahedral graph – 20 vertices, 30 edges (en)
  • Graf platoński – graf, którego wierzchołki i krawędzie są wierzchołkami i krawędziami wielościanu foremnego (bryły platońskiej). Graf platoński stanowi graf planarny utworzony w wyniku rzutu środkowego wierzchołków oraz krawędzi wielościanu foremnego na płaszczyznę. (pl)
rdfs:label
  • Platonic graph (en)
  • Graf platoński (pl)
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