On automorphism groups of some PCS graphs (Q1334946)

Let \(G= (V,E,C)\) be a simple undirected edge-colored finite graph, the color of an edge \((i,j)\) is denoted by \(c(i,j)\in C(G)\). \(\Aut(G)\) denotes the complete group of automorphisms of the graph \(G\) and \(\Aut_ c(G)\) its normal subgroup consisting of all color-preserving automorphisms. \(G\) is said to be a point-color symmetric graph (PCS) if \(\Aut_ c(G)\) acts transitively on \(V(G)\) and \(\Aut(G)\) acts transitivity on \(C(G)\). This paper reviews the characterization of PCS graphs based on the color- preserving automorphisms given by \textit{C. C. Chen} and \textit{H. H. Teh} [J. Comb. Theory, Ser. B 27, 160-167 (1979; Zbl 0418.05045)]. Particularly PCS pictures arrive at another characterization theorem. Finally a few results are summarized and some examples are given.