Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03742034n
Noun Concept
Categories: Parametric families of graphs, Regular graphs
EN
complete graph  complete digraph  complete digraphs  complete graphs  Full graph
EN
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. Wikipedia
Definitions
Relations
Sources
EN
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. Wikipedia
A graph in which every two vertices are adjacent Wikipedia Disambiguation
An undirected graph in which every pair of vertices has exactly one edge connecting them Wikipedia Disambiguation
A graph where every pair of vertices is connected by an edge. Wiktionary
Graph. Wiktionary (translation)
IS A
cograph
strongly regular graph
symmetric graph
hypohamiltonian graph
undirected graph
HAS KIND
tournament
clique
complement graph
Petersen family
HAS INSTANCE
Tetrahedral graph
graphe singleton
OPPOSITE OF
null graph
STUDIED BY
graph theory
Wikipedia
EN
complete graph
Wikidata
EN
complete graph
Wiktionary
EN
complete graph
Wikipedia Redirections
EN
Complete graphs, Full graph, K n, Mystic Rose, Tetrahedral Graph
Wikidata Alias
EN
complete digraph, complete digraphs, complete graphs

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License