CompleteGraph( G )
CompleteGraph( G, n )
CompleteGraph( G, n, mustloops )
This function returns a complete graph on n vertices with associated
(permutation) group G. The parameter n may be omitted, in which case
the number of vertices is the largest point moved by a generator of G.
The optional boolean parameter mustloops determines whether the
complete graph has all loops present or no loops (default: false
(no
loops)).
See also IsCompleteGraph.
gap> CompleteGraph( Group( (1,2,3), (1,2) ) ); rec( isGraph := true, order := 3, group := Group( (1,2,3), (1,2) ), schreierVector := [ -1, 1, 1 ], adjacencies := [ [ 2, 3 ] ], representatives := [ 1 ], isSimple := true )
GAP 3.4.4