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

The Wiener–Araya graph is, in graph theory, a graph on 42 vertices with 67 edges. It is hypohamiltonian, which means thatit does not itself have a Hamiltonian cycle but every graph formed by removing a single vertex from it is Hamiltonian. It is also planar.

Property Value
dbo:abstract
  • Le graphe de Wiener-Araya est, en théorie des graphes, un graphe possédant 42 sommets et 67 arêtes. Il est hypohamiltonien, c'est-à-dire qu'il n'a pas de cycle hamiltonien mais que la suppression de n'importe lequel de ses sommets suffit à le rendre hamiltonien. Il est également planaire. (fr)
  • The Wiener–Araya graph is, in graph theory, a graph on 42 vertices with 67 edges. It is hypohamiltonian, which means thatit does not itself have a Hamiltonian cycle but every graph formed by removing a single vertex from it is Hamiltonian. It is also planar. (en)
  • Граф Винера — Арайи — граф с 42 вершинами и 67 рёбрами. Он гипогамильтонов, что означает, что сам по себе он не имеет гамильтонова цикла, но любой граф, образованный удалением отдельной вершины, гамильтонов. Он также планарен. (ru)
dbo:thumbnail
dbo:wikiPageID
  • 47091172 (xsd:integer)
dbo:wikiPageLength
  • 5034 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1123123521 (xsd:integer)
dbo:wikiPageWikiLink
dbp:automorphisms
  • 2 (xsd:integer)
dbp:chromaticIndex
  • 4 (xsd:integer)
dbp:chromaticNumber
  • 3 (xsd:integer)
dbp:diameter
  • 7 (xsd:integer)
dbp:edges
  • 67 (xsd:integer)
dbp:girth
  • 4 (xsd:integer)
dbp:id
  • Wiener-ArayaGraph (en)
dbp:name
  • Wiener-Araya graph (en)
dbp:properties
dbp:radius
  • 5 (xsd:integer)
dbp:title
  • Wiener-Araya Graph (en)
dbp:vertices
  • 42 (xsd:integer)
dbp:wikiPageUsesTemplate
dcterms:subject
rdfs:comment
  • Le graphe de Wiener-Araya est, en théorie des graphes, un graphe possédant 42 sommets et 67 arêtes. Il est hypohamiltonien, c'est-à-dire qu'il n'a pas de cycle hamiltonien mais que la suppression de n'importe lequel de ses sommets suffit à le rendre hamiltonien. Il est également planaire. (fr)
  • The Wiener–Araya graph is, in graph theory, a graph on 42 vertices with 67 edges. It is hypohamiltonian, which means thatit does not itself have a Hamiltonian cycle but every graph formed by removing a single vertex from it is Hamiltonian. It is also planar. (en)
  • Граф Винера — Арайи — граф с 42 вершинами и 67 рёбрами. Он гипогамильтонов, что означает, что сам по себе он не имеет гамильтонова цикла, но любой граф, образованный удалением отдельной вершины, гамильтонов. Он также планарен. (ru)
rdfs:label
  • Graphe de Wiener-Araya (fr)
  • Граф Винера — Арайи (ru)
  • Wiener–Araya graph (en)
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 3.0 Unported License