About: Zero-symmetric graph

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

Connected graph in which each vertex has exactly three incident edges and, for each two vertices, there is a unique symmetry taking one vertex to the other

thumbnail
Property Value
dbo:description
  • matematikai fogalom a gráfelméletben (hu)
  • connected graph in which each vertex has exactly three incident edges and, for each two vertices, there is a unique symmetry taking one vertex to the other (en)
dbo:thumbnail
dbo:wikiPageWikiLink
dbp:align
  • right (en)
dbp:alt
  • 18 (xsd:integer)
  • Truncated cuboctahedron (en)
dbp:caption
  • The truncated cuboctahedron, a zero-symmetric polyhedron (en)
  • The smallest zero-symmetric graph, with 18 vertices and 27 edges (en)
dbp:direction
  • horizontal (en)
dbp:image
  • 18 (xsd:integer)
  • Great rhombicuboctahedron.png (en)
dbp:width
  • 200 (xsd:integer)
dbp:wikiPageUsesTemplate
dct:subject
rdfs:label
  • Zero-symmetric graph (en)
  • Graphe zéro-symétrique (fr)
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
foaf:isPrimaryTopicOf
is dbo:wikiPageWikiLink of
is dbp:properties 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