The Complexity of Power Graphs Associated With Finite Groups

Authors

  • Steve Kirkland University of Manitoba
  • Ali Reza Moghaddamfar Faculty of Mathematics, K.N. Toosi University of Technology
  • S. Navid Salehy Department of Mathematics, Florida State University
  • S. Nima Salehy Department of Mathematics, Florida State University
  • Mahsa Zohouratar Faculty of Mathematics, K.N. Toosi University of Technology

DOI:

https://doi.org/10.11575/cdm.v13i2.62733

Keywords:

Power graph, spanning tree, complexity, group.

Abstract

The power graph P(G) of a finite group G is the graph whose vertex set is
G, with two elements in G being adjacent if one of them is a power of the
other. The purpose of this paper is twofold: (1) to find the complexity of
a clique-replaced graph and study some applications; (2) to derive some
explicit formulas concerning the complexity \kappa(P(G)) for various groups
G such as the cyclic group of order n, the simple groups L_2(q), the extra-
special p-groups of order p^3, the Frobenius groups, etc.

References

1. J. H. Abawajy, A. V. Kelarev, and M. Chowdhury, Power graphs: a survey, Electronic J. Graph Theory and Applications 1 (2013), 125-147.

2. N. Biggs, Algebraic graph theory, Cambridge University Press, 1974.

3. A. E. Brouwer and W. H. Haemers, Spectra of graphs, Springer, 2012.

4. P. J. Cameron, The power graph of a finite group. II, J. Group Theory 13 (2010), 779-783.

5. A. Cayley, A theorem on trees, Quart. J. Math. 23 (1889), 376-378.

6. S. Chaiken, A combinatorial proof of the all minors matrix tree theorem, SIAM J. Algebraic Discrete Methods 3 (1982), 319-329.

7. I. Chakrabarty, S. Ghosh, and M. K. Sen, Undirected power graphs of semigroups, Semigroup Forum 78 (2009), 410-426.

8. B. Huppert, Endliche gruppen i, Springer, 1967.

9. M. I. Isaacs, Finite group theory, Graduate Studies in Mathematics, vol. 92, American Mathematical Society, 2008.

10. A. V. Kelarev, Graph algebras and automata, Marcel Dekker, 2003.

11. A. V. Kelarev and S. J. Quinn, A combinatorial property and power graphs of groups, Contrib. General Algebra 12 (2000), 229-235.

12. A. V. Kelarev, J. Ryan, and J. Yearwood, Cayley graphs as classifiers for data mining: The influence of asymmetries, Discrete Math. 309 (2009), 5360-5369.

13. Z. Mehranian, A. Gholami, and A. R. Ashrafi, A note on the power graph of a finite group, Int. J. Group Theory 5 (2016), 1-10.

14. R. Merris, Laplacian graph eigenvectors, Linear Algebra Appl. 278 (1998), 221-236.

15. A. R. Moghaddamfar, S. Rahbariyan, S. Navid Salehy, and S. Nima Salehy, The number of spanning trees of power graphs associated with specific groups and some applications, Ars Combinatoria 113 (2017), 269-296.

16. A. R. Moghaddamfar, S. Rahbariyan, and W. J. Shi, Certain properties of the power graph associated with a finite group, J. Algebra Appl. 13 (2014), no. 7, 1450040.

Downloads

Published

2018-12-31

Issue

Vol. 13 No. 2 (2018)

Section

Articles

License

 

This copyright statement was adapted from the statement for the University of Calgary Repository and from the statement for the Electronic Journal of Combinatorics (with permission).

The copyright policy for Contributions to Discrete Mathematics (CDM) is changed for all articles appearing in issues of the journal starting from Volume 15 Number 3.

Author(s) retain copyright over submissions published starting from  Volume 15 number 3.   When the author(s) indicate approval of the finalized version of the article provided by the technical editors of the journal and indicate approval, they grant to Contributions to Discrete Mathematics (CDM)  a world-wide, irrevocable, royalty free,  non-exclusive license as described below:

The author(s) grant to CDM the right to reproduce, translate (as defined below), and/or distribute the material, including the abstract, in print and electronic format, including but not limited to audio or video.

The author(s) agree that the journal may translate, without changing the content the material, to any medium or format for the purposes of preservation. 

The author(s) also agree that the journal may keep more than one copy of the article for the purposes of security, back-up, and preservation.

In granting the journal this license the author(s) warrant that the work is their original work and that they have the right to grant the rights contained in this license.

The authors represent that the work does not, to the best of their knowledge, infringe upon anyone’s copyright.

If the work contains material for which the author(s) do not hold copyright, the author(s) represent that the unrestricted permission of the copyright holder(s) to grant CDM the rights required by this license has been obtained, and that such third-party owned material is clearly identified and acknowledged within the text or content of the work.

The author(s) agree to ensure, to the extent reasonably possible, that further publication of the Work, with the same or substantially the same content, will acknowledge prior publication in CDM.

The journal highly recommends that the work be published with a Creative Commons license.   Unless otherwise arranged at the time the finalized version is approved and the licence granted with CDM,  the work will appear with the CC-BY-ND logo.  Here is the site to get more detail, and an excerpt from the site about the CC-BY-ND.  https://creativecommons.org/licenses/

Attribution-NoDerivs
CC BY-ND

This license lets others reuse the work for any purpose, including commercially; however, it cannot be shared with others in adapted form, and credit must be provided to you.