Qurak

CompleteGraph

Available

`CompleteGraph[n]` is the complete graph on `n` vertices — every pair of

CompleteGraph[n]
CompleteGraph[{n1, n2, …, nk}]
EdgeCount[CompleteGraph[4]] → 6EdgeCount[CompleteGraph[{2, 3}]] → 6VertexCount[CompleteGraph[{2, 3}]] → 5BipartiteGraphQ[CompleteGraph[{2, 3}]] → True

Topics

Related

All 6300 functions · Use this from an MCP client