Journal•ISSN: 0037-1912
Semigroup Forum
Springer Science+Business Media
About: Semigroup Forum is an academic journal published by Springer Science+Business Media. The journal publishes majorly in the area(s): Semigroup & Special classes of semigroups. It has an ISSN identifier of 0037-1912. Over the lifetime, 3664 publications have been published receiving 32774 citations. The journal is also known as: Semigroup forum (Print).
Topics: Semigroup, Special classes of semigroups, Monoid, Bicyclic semigroup, Cancellative semigroup
Papers published on a yearly basis
Papers
More filters
••
392 citations
••
TL;DR: In this article, it was shown that the multiplicative semigroup ℤn and its subgroup Un is complete if and only if n = 1,2,4,p or 2p, where p is a Fermat prime.
Abstract: The undirected power graph G(S) of a semigroup S is an undirected graph whose vertex set is S and two vertices a,b∈S are adjacent if and only if a≠b 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.
266 citations
••
TL;DR: In this paper, an undirected graph Γ(S) is associated to each commutative multiplicative semigroup S with 0, where vertices of the graph are labeled by the nonzero zero-divisors of S, and two vertices x,y are connected by an edge in case xy = 0 in S.
Abstract: An undirected graph Γ(S) is associated to each commutative multiplicative semigroup S with 0. The vertices of the graph are labeled by the nonzero zero-divisors of S , and two vertices x,y are connected by an edge in case xy = 0 in S . The properties and possible structures of the graph Γ (S) are studied.
214 citations