Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Frucht_graph> ?p ?o. }
Showing items 1 to 45 of
45
with 100 items per page.
- Frucht_graph abstract "In the mathematical field of graph theory, the Frucht graph is a 3-regular graph with 12 vertices, 18 edges, and no nontrivial symmetries. It was first described by Robert Frucht in 1939.The Frucht graph is a Halin graph with chromatic number 3, chromatic index 3, radius 3, diameter 4 and girth 3. As with every Halin graph, the Frucht graph is planar, 3-vertex-connected, and polyhedral. It is also a 3-edge-connected graph. Its independence number is 5.The Frucht graph is Hamiltonian and can be constructed from the LCF notation: [−5,−2,−4,2,5,−2,2,5,−2,−5,4,2].".
- Frucht_graph thumbnail Frucht_planar_Lombardi.svg?width=300.
- Frucht_graph wikiPageID "23784721".
- Frucht_graph wikiPageRevisionID "542846763".
- Frucht_graph automorphisms "1".
- Frucht_graph chromaticIndex "3".
- Frucht_graph chromaticNumber "3".
- Frucht_graph diameter "4".
- Frucht_graph edges "18".
- Frucht_graph girth "3".
- Frucht_graph hasPhotoCollection Frucht_graph.
- Frucht_graph imageCaption "The Frucht graph".
- Frucht_graph name "Frucht graph".
- Frucht_graph namesake "Robert Frucht".
- Frucht_graph properties Cubic_graph.
- Frucht_graph properties Hamiltonian_path.
- Frucht_graph properties Planar_graph.
- Frucht_graph radius "3".
- Frucht_graph vertices "12".
- Frucht_graph subject Category:Individual_graphs.
- Frucht_graph subject Category:Planar_graphs.
- Frucht_graph subject Category:Regular_graphs.
- Frucht_graph type Abstraction100002137.
- Frucht_graph type Communication100033020.
- Frucht_graph type Graph107000195.
- Frucht_graph type IndividualGraphs.
- Frucht_graph type PlanarGraphs.
- Frucht_graph type RegularGraphs.
- Frucht_graph type VisualCommunication106873252.
- Frucht_graph comment "In the mathematical field of graph theory, the Frucht graph is a 3-regular graph with 12 vertices, 18 edges, and no nontrivial symmetries. It was first described by Robert Frucht in 1939.The Frucht graph is a Halin graph with chromatic number 3, chromatic index 3, radius 3, diameter 4 and girth 3. As with every Halin graph, the Frucht graph is planar, 3-vertex-connected, and polyhedral. It is also a 3-edge-connected graph.".
- Frucht_graph label "Frucht graph".
- Frucht_graph label "Grafo de Frucht".
- Frucht_graph label "Grafo di Frucht".
- Frucht_graph label "Graphe de Frucht".
- Frucht_graph label "Граф Фрухта".
- Frucht_graph sameAs Graphe_de_Frucht.
- Frucht_graph sameAs Grafo_di_Frucht.
- Frucht_graph sameAs Grafo_de_Frucht.
- Frucht_graph sameAs m.06_x5gf.
- Frucht_graph sameAs Q2061755.
- Frucht_graph sameAs Q2061755.
- Frucht_graph sameAs Frucht_graph.
- Frucht_graph wasDerivedFrom Frucht_graph?oldid=542846763.
- Frucht_graph depiction Frucht_planar_Lombardi.svg.
- Frucht_graph isPrimaryTopicOf Frucht_graph.
