generate#
The mirror image of a plane graph is obtained by reversing the cyclic order at each vertex; this corresponds to reflecting the plane about a line.
A separating cycle in a plane graph is a cycle that contains at least one vertex in its interior and at least one vertex in its exterior.
The length of the smallest separating cycle in a triangulation is the same as the (vertex) connectivity, and is known to equal the cyclic connectivity of the cubic dual graph
An orientationpreserving isomorphism (OP-isomorphism) orientation-reversing isomorphism (OR-isomorphism) the automorphism group Aut(G) of a plane graph is the group of all isomorphisms from G to itself, and the OP-automorphism group
Functions
|
|
|
Generate connected graph with up to n vertices with degrees degrees. |
|