Affiliation:
1. School of Science, Xi'an Shiyou University, Xi'an 710065, China
2. Information Technology Education Center, Zhaotong University, Zhaotong 657000, China
3. School of Mathematics and Statistics, Zhaotong University, Zhaotong 657000, China
Abstract
<p>In this study, we explore the main supergraph $ \mathcal{S}(G) $ of a finite group $ G $, defined as an undirected, simple graph with a vertex set $ G $ in which two distinct vertices, $ a $ and $ b $, are adjacent in $ \mathcal{S}(G) $ if the order of one is a divisor of the order of the other. This is denoted as either $ o(a)\mid o(b) $ or $ o(b)\mid o(a) $, where $ o(\cdot) $ is the order of an element. We classify finite groups for which the main supergraph is either a split graph or a threshold graph. Additionally, we characterize finite groups whose main supergraph is a cograph. Our classification extends to finite groups $ G $ with $ \mathcal{S}(G) $, a cograph that includes when $ G $ is a direct product of two non-trivial groups, as well as when $ G $ is either a dihedral group, a generalized quaternion group, a symmetric group, an alternating group, or a sporadic simple group.</p>
Publisher
American Institute of Mathematical Sciences (AIMS)
Reference29 articles.
1. A. Kelarev, Ring Constructions and Applications, World Scientific Publishing, Singapore, 2002. https://doi.org/10.1142/4807
2. A. Kelarev, J. Ryan, J. Yearwood, Cayley graphs as classifiers for data mining: The influence of asymmetries, Discrete Math., 309 (2009), 5360–5369. https://doi.org/10.1016/j.disc.2008.11.030
3. A. Kelarev, S. Quinn, A combinatorial property and power graphs of groups, Contrib. Gen. Algebra, 12 (2000), 229–235.
4. I. Chakrabarty, S. Ghosh, M. Sen, Undirected power graphs of semigroups, Semigroup Forum, 78 (2009), 410–426. https://doi.org/10.1007/s00233-008-9132-y
5. G. Pourgholi, H. Yousefi-Azari, A. Ashrafi, The undirected power graph of a finite group, Bull. Malays. Math. Sci. Soc., 38 (2015), 1517–1525. https://doi.org/10.1007/s40840-015-0114-4