全部 标题 作者
关键词 摘要

Algebra  2013 

The Cyclic Graph of a Finite Group

DOI: 10.1155/2013/107265

Full-Text   Cite this paper   Add to My Lib

Abstract:

The cyclic graph of a finite group is as follows: take as the vertices of and join two distinct vertices and if is cyclic. In this paper, we investigate how the graph theoretical properties of affect the group theoretical properties of . First, we consider some properties of and characterize certain finite groups whose cyclic graphs have some properties. Then, we present some properties of the cyclic graphs of the dihedral groups and the generalized quaternion groups for some . Finally, we present some parameters about the cyclic graphs of finite noncyclic groups of order up to . 1. Introduction and Results Recently, study of algebraic structures by graphs associated with them gives rise to many interesting results. There are many papers on assigning a graph to a group and algebraic properties of group by using the associated graph; for instance, see [1–4]. Let be a group with identity element . One can associate a graph to in many different ways. Abdollahi and Hassanabadi introduced a graph (called the noncyclic graph of a group; see [4]) associated with a group by the cyclicity of subgroups. It is a graph whose vertex set is the set , where is cyclic for all and is adjacent if is not a cyclic subgroup. They established some graph theoretical properties (such as regularity) of this graph in terms of the group ones. In this paper, we consider the converse. We associate a graph with (called the cyclic graph of ) as follows: take as the vertices of and two distinct vertices and are adjacent if and only if is a cyclic subgroup of . For example, Figure 1 is the cyclic graph of , and Figure 2 is . For any group , it is easy to see that the cyclic graph is simple and undirected with no loops and multiple edges. By the definition, we shall explore how the graph theoretical properties of affect the group theoretical properties of . In particular, the structure of the group by some graph theoretical properties of the associated graph is determined. Figure 1: . Figure 2: . The outline of this paper is as follows. In Section 2, we introduce a lot of basic concepts and notations of group and graph theory which will be used in the sequel. In Section 3, we give some properties of the cyclic graph of a group on diameter, planarity, partition, clique number, and so forth and characterize a finite group whose cyclic graph is complete (planar, a star, regular, etc.). For example, the cyclic graph of any group is always connected whose diameter is at most 2 and the girth is either 3 or ; the cyclic graph of group is complete if and only if is cyclic and is a star if and

References

[1]  A. Abdollahi, S. Akbari, and H. R. Maimani, “Non-commuting graph of a group,” Journal of Algebra, vol. 298, no. 2, pp. 468–492, 2006.
[2]  P. Balakrishnan, M. Sattanathan, and R. Kala, “The center graph of a group,” South Asian Journal of Mathematics, vol. 1, no. 1, pp. 21–28, 2011.
[3]  I. Chakrabarty, S. Ghosh, and M. K. Sen, “Undirected power graphs of semigroups,” Semigroup Forum, vol. 78, no. 3, pp. 410–426, 2009.
[4]  A. Abdollahi and A. M. Hassanabadi, “Noncyclic graph of a group,” Communications in Algebra, vol. 35, no. 7, pp. 2057–2081, 2007.
[5]  C. Gary and P. Zhang, Introduction to Graph Theory, Posts and Telecom Press, Beijing, China, 2006.
[6]  H. Kurzweil and B. Stellmacher, The Theory of Finite Groups. An Introduction, Universitext, Springer, New York, NY, USA, 2004.
[7]  S. J. Baishya, “A note on finite C-tidy groups,” International Journal of Group Theory, vol. 2, no. 3, pp. 9–17, 2013.
[8]  D. Patrick and E. Wepsic, “Cyclicizers, centralizers and normalizers,” Tech. Rep. MS-TR 91-05, Rose-Hulman Institute of Technology, Terre Haute, Ind, USA, 1991.
[9]  K. O'Bryant, D. Patrick, L. Smithline, and E. Wepsic, “Some facts about cycles and tidy groups,” Tech. Rep. MS-TR 92-04, Rose-Hulman Institute of Technology, Terre Haute, Ind, USA, 1992.

Full-Text

comments powered by Disqus