complete graph (Q45715)

From Wikidata
Jump to: navigation, search
simple undirected graph in which every pair of distinct vertices is connected by a unique edge
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

    Statements

    Identifiers

     
    edit
      edit
        edit
          edit
            edit
              edit
                edit
                  edit