On Involutions Arising from Graphs | SpringerLink
Skip to main content

On Involutions Arising from Graphs

  • Chapter
  • First Online:
Algorithmic Bioprocesses

Part of the book series: Natural Computing Series ((NCS))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 22879
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 28599
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
JPY 28599
Price includes VAT (Japan)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Corneil DG, Mathon RA (eds) (1991) Geometry and combinatorics: selected works of J.J. Seidel. Academic Press, Boston

    Google Scholar 

  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. Ehrenfeucht A, Harju T, Rozenberg G (1999) The theory of 2-structures. World Scientific, Singapore

    MATH  Google Scholar 

  4. Hage J (1999) The membership problem for switching classes with skew gains. Fundam Inform 39(4):375–387

    MATH  MathSciNet  Google Scholar 

  5. Hage J (2001) Structural aspects of switching classes. PhD thesis. Leiden Institute of Advanced Computer Science. http://www.cs.uu.nl/people/jur/2s.html

  6. Hage J, Harju T (2000) The size of switching classes with skew gains. Discrete Math 215:81–92

    Article  MATH  MathSciNet  Google Scholar 

  7. Hardy GH, Wright EM (1983) An introduction to the theory of numbers, 5th edn. Oxford Science Publications, Hong Kong

    Google Scholar 

  8. Rotman JJ (1973) The theory of groups, 2nd edn. Allyn and Bacon, Boston

    MATH  Google Scholar 

  9. Rotman JJ (2002) Advanced modern algebra. Pearson Education, Upper Saddle River

    MATH  Google Scholar 

  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. 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. Zaslavsky T (1989) Biased graphs, I: bias, balance, and gains. J Comb Theory, Ser B 47:32–52

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jurriaan Hage .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Hage, J., Harju, T. (2009). On Involutions Arising from Graphs. In: Condon, A., Harel, D., Kok, J., Salomaa, A., Winfree, E. (eds) Algorithmic Bioprocesses. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88869-7_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88869-7_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88868-0

  • Online ISBN: 978-3-540-88869-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics