Revision history [back]
 | 1 | initial version |
Using the Graph([list_of_vertices, list_of_edges]) construction,
one can build a graph with vertices the elements in the symmetric
group $S_3$, and with no edges, as follows:
sage: S = SymmetricGroup(3)
sage: G = Graph([list(S), []])
sage: G
Graph on 6 vertices
Not a very interesting graph... If the goal is a Cayley graph, use the dedicated method:
sage: C = S.cayley_graph()
sage: C
Digraph on 6 vertices
Tested with SageMath 8.8.beta4 built for Python 3.
