On Involutions Arising from Graphs

  • Jurriaan HageEmail author
  • Tero Harju
Part of the Natural Computing Series book series (NCS)


We investigate various aspects of involutions of groups, i.e. anti-automorphisms of order at most two. The emphasis is on finite Abelian groups. We count the number of involutions for the cyclic groups, and consider the problem for direct products of groups. We also give a characterization for the set of skewed squares of finitely generated Abelian groups with identity as the involution. The present paper is motivated by our research into switching classes of combinatorial graphs where the edges have skew gains.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Corneil DG, Mathon RA (eds) (1991) Geometry and combinatorics: selected works of J.J. Seidel. Academic Press, Boston Google Scholar
  2. 2.
    Ehrenfeucht A, Hage J, Harju T, Rozenberg G (2004) Embedding in switching classes with skew gains. In: Ehrig H, Engels G, Parisi-Presicce F (eds) Graph transformations, second international conference, ICGT 2004. Lecture notes in computer science, vol 3256. Springer, Berlin, pp 257–270 Google Scholar
  3. 3.
    Ehrenfeucht A, Harju T, Rozenberg G (1999) The theory of 2-structures. World Scientific, Singapore zbMATHGoogle Scholar
  4. 4.
    Hage J (1999) The membership problem for switching classes with skew gains. Fundam Inform 39(4):375–387 zbMATHMathSciNetGoogle Scholar
  5. 5.
    Hage J (2001) Structural aspects of switching classes. PhD thesis. Leiden Institute of Advanced Computer Science.
  6. 6.
    Hage J, Harju T (2000) The size of switching classes with skew gains. Discrete Math 215:81–92 zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Hardy GH, Wright EM (1983) An introduction to the theory of numbers, 5th edn. Oxford Science Publications, Hong Kong Google Scholar
  8. 8.
    Rotman JJ (1973) The theory of groups, 2nd edn. Allyn and Bacon, Boston zbMATHGoogle Scholar
  9. 9.
    Rotman JJ (2002) Advanced modern algebra. Pearson Education, Upper Saddle River zbMATHGoogle Scholar
  10. 10.
    Seidel JJ (1976) A survey of two-graphs. In: Intern coll teorie combinatorie, Roma, 1973, vol I. Accad Naz Lincei, Rome, pp 481–511. Reprinted in [1] Google Scholar
  11. 11.
    Seidel JJ, Taylor DE (1981) Two-graphs, a second survey. In: Lovasz L, Sós V.T. (eds) Algebraic methods in graph theory, proceedings of the international colloqium, Szeged, 1978, vol II. North-Holland, Amsterdam, pp 689–711. Reprinted in [1] Google Scholar
  12. 12.
    Zaslavsky T (1989) Biased graphs, I: bias, balance, and gains. J Comb Theory, Ser B 47:32–52 zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  1. 1.Department of Information and Computing SciencesUniversiteit UtrechtUtrechtThe Netherlands
  2. 2.Department of MathematicsUniversity of TurkuTurkuFinland

Personalised recommendations