The Total Group of a Graph

Mehdi Behzad, Heydar Radjavi
1968 Proceedings of the American Mathematical Society  
We consider ordinary graphs (finite, undirected, with no loops or multiple lines). A well-known concept in the theory of graphs is that of the (point) group r(C7) of a graph G, which is the group of all adjacency-preserving permutations of points of C7. The elements of r(C7) are called (point-) automorphisms
doi:10.2307/2036158 fatcat:vxcyzwctn5c4pnfr2vc3i6e75u