complete graph (Q45715)

From Wikidata
Jump to navigation Jump to search
simple undirected graph in which every pair of distinct vertices is connected by a unique edge
  • complete digraph
  • complete graphs
  • complete digraphs
edit
Language Label Description Also known as
English
complete graph
simple undirected graph in which every pair of distinct vertices is connected by a unique edge
  • complete digraph
  • complete graphs
  • complete digraphs

Statements

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
1
0 references
1
0 references
Complete graphs
0 references

Identifiers

 
edit
    edit
      edit
        edit
          edit
            edit
              edit
                edit