- A graph is complete if there is an edge between every pair of distinct vertices.
- CompleteGraphQ works with undirected graphs, directed graphs, multigraphs, and mixed graphs.
Examplesopen allclose all
Properties & Relations (11)
A TreeGraph is not a complete graph:
The GraphComplement of a complete graph is an empty graph:
For a complete graph, all entries outside the diagonal are 1s in the AdjacencyMatrix:
Introduced in 2010
|Updated in 2014