Article contents
A report on stable graphs
Published online by Cambridge University Press: 09 April 2009
Extract
It is the aim of this paper to introduce a new concept relating various subgroups of the automorphism group of a graph to corresponding subgraphs. Throughout g will denote a (Michigan) graph on a vertex set V(¦V¦ =n) and Γ(g)=G will be the automorphism group of G considered as a permutation group on V.En, Cn, Dn and Sn are the identity, cyclic, dihedral, and symmetric groups acting on a set of size n, while Sp(q) is the permutation group of pq objects which is isomorphic to Sp but is q-fold in the sense that the objects are permuted q at a time [6]. H ≦ G means that H is a subgroup of G. Other group concepts can be found in Wielandt [7]. The graphs G1 ∪ G2, G1 + G2, G1 × G2, and G1[G2] along with their corresponding groups are as defined in, for example, Harary [4]. Finally we use Kn for the complete graph on n vertices.
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Society 1973
References
- 17
- Cited by