Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Clebsch_graph> ?p ?o. }
Showing items 1 to 53 of
53
with 100 items per page.
- Clebsch_graph abstract "In the mathematical field of graph theory, the Clebsch graph is either of two complementary graphs on 16 vertices, a 5-regular graph with 40 edges and a 10-regular graph with 80 edges. The 80-edge variant is the order-5 halved cube graph; it was called the Clebsch graph name by Seidel (1968) because of its relation to the configuration of 16 lines on the quartic surface discovered in 1868 by the German mathematician Alfred Clebsch. The 40-edge variant is the order-5 folded cube graph; it is also known as the Greenwood–Gleason graph after the work of Robert E. Greenwood and Andrew M. Gleason (1955), who used it to evaluate the Ramsey number R(3,3,3) = 17.".
- Clebsch_graph thumbnail Clebsch_Lombardi.svg?width=300.
- Clebsch_graph wikiPageID "23970662".
- Clebsch_graph wikiPageRevisionID "598931744".
- Clebsch_graph author2Link "Andrew Gleason".
- Clebsch_graph automorphisms "1920".
- Clebsch_graph chromaticIndex "5".
- Clebsch_graph chromaticNumber "4".
- Clebsch_graph diameter "2".
- Clebsch_graph edges "40".
- Clebsch_graph first "Andrew M.".
- Clebsch_graph first "Robert E.".
- Clebsch_graph girth "4".
- Clebsch_graph hasPhotoCollection Clebsch_graph.
- Clebsch_graph last "Gleason".
- Clebsch_graph last "Greenwood".
- Clebsch_graph name "Clebsch graph".
- Clebsch_graph namesake Alfred_Clebsch.
- Clebsch_graph properties Cayley_graph.
- Clebsch_graph properties Distance-transitive_graph.
- Clebsch_graph properties Edge-transitive_graph.
- Clebsch_graph properties Hamiltonian_path.
- Clebsch_graph properties Strongly_regular_graph.
- Clebsch_graph properties Triangle-free_graph.
- Clebsch_graph properties Vertex-transitive_graph.
- Clebsch_graph radius "2".
- Clebsch_graph vertices "16".
- Clebsch_graph year "1955".
- Clebsch_graph subject Category:4-chromatic_graphs.
- Clebsch_graph subject Category:Individual_graphs.
- Clebsch_graph subject Category:Regular_graphs.
- Clebsch_graph type Abstraction100002137.
- Clebsch_graph type Communication100033020.
- Clebsch_graph type Graph107000195.
- Clebsch_graph type IndividualGraphs.
- Clebsch_graph type RegularGraphs.
- Clebsch_graph type VisualCommunication106873252.
- Clebsch_graph comment "In the mathematical field of graph theory, the Clebsch graph is either of two complementary graphs on 16 vertices, a 5-regular graph with 40 edges and a 10-regular graph with 80 edges. The 80-edge variant is the order-5 halved cube graph; it was called the Clebsch graph name by Seidel (1968) because of its relation to the configuration of 16 lines on the quartic surface discovered in 1868 by the German mathematician Alfred Clebsch.".
- Clebsch_graph label "Clebsch graph".
- Clebsch_graph label "Clebsch-Graph".
- Clebsch_graph label "Grafo de Clebsch".
- Clebsch_graph label "Graphe de Clebsch".
- Clebsch_graph label "Граф Клебша".
- Clebsch_graph sameAs Clebsch-Graph.
- Clebsch_graph sameAs Grafo_de_Clebsch.
- Clebsch_graph sameAs Graphe_de_Clebsch.
- Clebsch_graph sameAs m.076x2x8.
- Clebsch_graph sameAs Q367494.
- Clebsch_graph sameAs Q367494.
- Clebsch_graph sameAs Clebsch_graph.
- Clebsch_graph wasDerivedFrom Clebsch_graph?oldid=598931744.
- Clebsch_graph depiction Clebsch_Lombardi.svg.
- Clebsch_graph isPrimaryTopicOf Clebsch_graph.