zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Undirected power graphs of semigroups. (English) Zbl 1207.05075
Summary: The undirected power graph 𝒢(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 a m =b or b m =a for some positive integer m. In this paper we characterize the class of semigroups S for which 𝒢(S) is connected or complete. As a consequence we prove that 𝒢(G) is connected for any finite group G and 𝒢(G) is complete if and only if G is a cyclic group of order 1 or p m . Particular attention is given to the multiplicative semigroup n and its subgroup U n , where 𝒢(U n ) is a major component of 𝒢( n ). It is proved that 𝒢(U n ) 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) for a finite group G and apply this result to determine the values of n for which G(U n ) is planar. Finally we show that for any cyclic group of order greater than or equal to 3, 𝒢(G) is Hamiltonian and list some values of n for which 𝒢(U n ) has no Hamiltonian cycle.
05C25Graphs and abstract algebra
20M10General structure theory of semigroups
05C45Eulerian and Hamiltonian graphs
[1]Bosak, J.: The graphs of semigroups. In: Theory of Graphs and Application, pp. 119–125. Academic Press, New York (1964)
[2]Budden, F.: Cayley graphs for some well-known groups. Math. Gaz. 69, 271–278 (1985) · Zbl 0584.05040 · doi:10.2307/3617571
[3]Gallian, J.A.: Contemporary Abstract Algebra. Narosa Publishing House, London (1999)
[4]Howie, J.M.: An Introduction to Semigroup Theory. Academic Press, London (1976)
[5]Hungerford, T.W.: Algebra. Springer, Berlin (1974)
[6]Jones, G.A., Jones, J.M.: Elementary Number Theory. Springer, New Delhi (2005)
[7]Kelarev, A.V., Quinn, S.J.: Directed graph and combinatorial properties of semigroups. J. Algebra 251, 16–26 (2002) · Zbl 1005.20043 · doi:10.1006/jabr.2001.9128
[8]Keller, W.: Prime factors of Fermat numbers. http://www.prothsearch.net/fermat.html
[9]West, D.B.: Introduction to Graph Theory. Prentice-Hall, New Delhi (2003)
[10]Witte, D., Letzter, G., Gallian, J.A.: On Hamiltonian circuits in Cartesian products of Cayley digraphs. Discrete Math. 43, 297–307 (1983) · Zbl 0503.05041 · doi:10.1016/0012-365X(83)90166-8
[11]Zelinka, B.: Intersection graphs of finite Abelian groups. Czech. Math. J. 25(100), 171–174 (1975)