complete graph

simple undirected graph in which every pair of distinct vertices is connected by a unique edge

en-US/kəmˈplit ˈɡɹæf/
en-GB/kəmˈpliːt ɡɹɑːf/

Categorieën:

geodetic graphsymmetric graphline graphconnected graphcluster graphintegral graphdense graphundirected graphHamming graphblock graphcirculant graphcoreJohnson graphstrongly regular graphTurán graphKneser graphuniquely colorable graphthreshold graph