Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Complete_graph> ?p ?o. }
Showing items 1 to 50 of
50
with 100 items per page.
- Complete_graph abstract "In the mathematical field of graph theory, a complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique edge. A complete digraph is a directed graph in which every pair of distinct vertices is connected by a pair of unique edges (one in each direction).Graph theory itself is typically dated as beginning with Leonhard Euler's 1736 work on the Seven Bridges of Königsberg. However, drawings of complete graphs, with their vertices placed on the points of a regular polygon, appeared already in the 13th century, in the work of Ramon Llull. Such a drawing is sometimes referred to as a mystic rose.".
- Complete_graph thumbnail Complete_graph_K7.svg?width=300.
- Complete_graph wikiPageID "85816".
- Complete_graph wikiPageRevisionID "591176245".
- Complete_graph chromaticIndex "if is even".
- Complete_graph chromaticIndex "if is odd".
- Complete_graph hasPhotoCollection Complete_graph.
- Complete_graph imageCaption ", a complete graph with 7 vertices".
- Complete_graph name "Complete graph".
- Complete_graph properties Edge-transitive_graph.
- Complete_graph properties Integral_graph.
- Complete_graph properties Regular_graph.
- Complete_graph properties Strongly_regular_graph.
- Complete_graph properties Symmetric_graph.
- Complete_graph properties Vertex-transitive_graph.
- Complete_graph title "Complete Graph".
- Complete_graph urlname "CompleteGraph".
- Complete_graph subject Category:Parametric_families_of_graphs.
- Complete_graph subject Category:Regular_graphs.
- Complete_graph type Abstraction100002137.
- Complete_graph type Communication100033020.
- Complete_graph type Graph107000195.
- Complete_graph type RegularGraphs.
- Complete_graph type VisualCommunication106873252.
- Complete_graph comment "In the mathematical field of graph theory, a complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique edge. A complete digraph is a directed graph in which every pair of distinct vertices is connected by a pair of unique edges (one in each direction).Graph theory itself is typically dated as beginning with Leonhard Euler's 1736 work on the Seven Bridges of Königsberg.".
- Complete_graph label "Complete graph".
- Complete_graph label "Graf pełny".
- Complete_graph label "Grafo completo".
- Complete_graph label "Grafo completo".
- Complete_graph label "Grafo completo".
- Complete_graph label "Graphe complet".
- Complete_graph label "Vollständiger Graph".
- Complete_graph label "Полный граф".
- Complete_graph label "رسم بياني كامل".
- Complete_graph label "完全圖".
- Complete_graph sameAs Úplný_graf.
- Complete_graph sameAs Vollständiger_Graph.
- Complete_graph sameAs Grafo_completo.
- Complete_graph sameAs Graphe_complet.
- Complete_graph sameAs Grafo_completo.
- Complete_graph sameAs 완전_그래프.
- Complete_graph sameAs Graf_pełny.
- Complete_graph sameAs Grafo_completo.
- Complete_graph sameAs m.0lrs0.
- Complete_graph sameAs Q45715.
- Complete_graph sameAs Q45715.
- Complete_graph sameAs Complete_graph.
- Complete_graph wasDerivedFrom Complete_graph?oldid=591176245.
- Complete_graph depiction Complete_graph_K7.svg.
- Complete_graph isPrimaryTopicOf Complete_graph.
