Semigroup Forum

, Volume 78, Issue 3, pp 410–426 | Cite as

Undirected power graphs of semigroups

Research Article

Abstract

The undirected power graph G(S) of a semigroup S is an undirected graph whose vertex set is S and two vertices a,bS are adjacent if and only if ab and am=b or bm=a for some positive integer m. In this paper we characterize the class of semigroups S for which G(S) is connected or complete. As a consequence we prove that G(G) is connected for any finite group G and G(G) is complete if and only if G is a cyclic group of order 1 or pm. Particular attention is given to the multiplicative semigroup ℤn and its subgroup Un, where G(Un) is a major component of G(ℤn). It is proved that G(Un) is complete if and only if n=1,2,4,p or 2p, where p is a Fermat prime. In general, we compute the number of edges of G(G) for a finite group G and apply this result to determine the values of n for which G(Un) is planar. Finally we show that for any cyclic group of order greater than or equal to 3, G(G) is Hamiltonian and list some values of n for which G(Un) has no Hamiltonian cycle.

Keywords

Semigroup Group Divisibility graph Power graph Connected graph Complete graph Fermat prime Planar graph Eulerian graph Hamiltonian graph 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bosak, J.: The graphs of semigroups. In: Theory of Graphs and Application, pp. 119–125. Academic Press, New York (1964) Google Scholar
  2. 2.
    Budden, F.: Cayley graphs for some well-known groups. Math. Gaz. 69, 271–278 (1985) MATHCrossRefGoogle Scholar
  3. 3.
    Gallian, J.A.: Contemporary Abstract Algebra. Narosa Publishing House, London (1999) Google Scholar
  4. 4.
    Howie, J.M.: An Introduction to Semigroup Theory. Academic Press, London (1976) MATHGoogle Scholar
  5. 5.
    Hungerford, T.W.: Algebra. Springer, Berlin (1974) MATHGoogle Scholar
  6. 6.
    Jones, G.A., Jones, J.M.: Elementary Number Theory. Springer, New Delhi (2005) Google Scholar
  7. 7.
    Kelarev, A.V., Quinn, S.J.: Directed graph and combinatorial properties of semigroups. J. Algebra 251, 16–26 (2002) MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Keller, W.: Prime factors of Fermat numbers. http://www.prothsearch.net/fermat.html
  9. 9.
    West, D.B.: Introduction to Graph Theory. Prentice-Hall, New Delhi (2003) Google Scholar
  10. 10.
    Witte, D., Letzter, G., Gallian, J.A.: On Hamiltonian circuits in Cartesian products of Cayley digraphs. Discrete Math. 43, 297–307 (1983) MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Zelinka, B.: Intersection graphs of finite Abelian groups. Czech. Math. J. 25(100), 171–174 (1975) MathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  1. 1.Department of MathematicsJadavpur UniversityKolkataIndia
  2. 2.Department of Pure MathematicsUniversity of CalcuttaKolkataIndia

Personalised recommendations