Skip to content
BY-NC-ND 3.0 license Open Access Published by De Gruyter Open Access February 5, 2016

On some characterizations of strong power graphs of finite groups

A. K. Bhuniya and Sudip Bera
From the journal Special Matrices

Abstract

Let G be a finite group of order n. The strong power graph Ps(G) of G is the undirected graph whose vertices are the elements of G such that two distinct vertices a and b are adjacent if am1=bm2 for some positive integers m1, m2 < n. In this article we classify all groups G for which Ps(G) is a line graph. Spectrum and permanent of the Laplacian matrix of the strong power graph Ps(G) are found for any finite group G.

References

[1] J. Abawajy, A. V. Kelarev and M. Chowdhury, Power graphs: A survey, Electron. J. Graph Theory Appl, 1(2013), 125-147. 10.5614/ejgta.2013.1.2.6Search in Google Scholar

[2] R. B. Bapat, Graphs and matrices, Second edition, Hindustan Book Agency, 2014. 10.1007/978-1-4471-6569-9Search in Google Scholar

[3] A. R. Brualdi and D. Cvetkovic, A Combinatorial approch to matrix theory and its application, CRC Press, 2009. 10.1201/9781420082241Search in Google Scholar

[4] P. J. Cameron and S. Ghosh, The power graph of a finite group, Discrete Math, 31(2011), 1220-1222. 10.1016/j.disc.2010.02.011Search in Google Scholar

[5] P. J. Cameron, The power graph of a finite group - II, J.Group Theory, 13(6)(2010), 779-783. 10.1515/jgt.2010.023Search in Google Scholar

[6] I. Chakrabarty, S. Ghosh and M. K. Sen, Undirected power graphs of semigroups, Semigroup Forum , 78(2009), 410-426. 10.1007/s00233-008-9132-ySearch in Google Scholar

[7] S. Chattopadhyay and P. Panigrahi, On Laplacian spectrum of power graphs of finite cyclic and dihedral groups, Linear and multilinear Algbra, 7(63)(2014), 1345-1355. 10.1080/03081087.2014.936435Search in Google Scholar

[8] M. Fielder, Algebraic connectivity of graphs, Czechoslovak Math. J, 23(1973), 298-305. 10.21136/CMJ.1973.101168Search in Google Scholar

[9] C. Godsil and G. Royle, Algebraic Graph Theory, Springer-Verlag, New York Inc, 2001. 10.1007/978-1-4613-0163-9Search in Google Scholar

[10] I. Gutman and B. Zhou, Laplacian energy of a graph, Linear Algebra Appl, 414(2006), 29-37. 10.1016/j.laa.2005.09.008Search in Google Scholar

[11] I. Gutman, B. Zhou and B. Furtula, The Laplacian energy like invarient is an energy like invarient, MATCH Commun. Math. Comput. Chem., 64(2010), 85-96. Search in Google Scholar

[12] Y. Hou, Unicyclic graphs with minimal energy, J. Math. Chem, 29(2001), 163-168. 10.1023/A:1010935321906Search in Google Scholar

[13] Y. Hou, Z. Teng and C. W. Woo, On the spectral radius, k degree and the upper bound of energy in a graph, MATCH Commun. Math. Comput. Chem., 57(2007), 341-350. Search in Google Scholar

[14] T. W. Hungerford, Algebra, Graduate Text in Mathematics 73, Springer-Verlag, New York(NY), (1974). 10.1007/978-1-4612-6101-8_4Search in Google Scholar

[15] A. V. Kelarev and S. J. Quinn, A combinatorial property and power graphs of groups, Contributions to General Algebra, 12(Heyn, Klagenfurt, 2000), 229-235. Search in Google Scholar

[16] X. Ma, On the spectra of strong power graphs of finite groups, Preprint arXiv:1506.07817 [math.GR]2015. Search in Google Scholar

[17] H. Minc, Permanents, Addition-Wesley, Reading, Mass, 1978. Search in Google Scholar

[18] H. Minc, Theory of permanents, Linear and Multilinear Algebra, 12(1983), 227-263. 10.1080/03081088308817488Search in Google Scholar

[19] B. Mohar, The Laplacian spectrumof graphs, In: Y. Alavi, G. Chartrand, Oellermann OR, A. J. Schwenk, editors. Graph Theory, combinatorics, and aplications, Wiley, New York, 2(1991), 871-898. Search in Google Scholar

[20] G. Singh and K. Manilal, Some generalities on power graphs and strong power graphs, Int. J. Contemp. Math Sciences, 5(55)(2010), 2723-2730. Search in Google Scholar

[21] D. B. West, Introduction to Graph theory, 2nd ed., Pearson education, 2001. Search in Google Scholar

Received: 2015-8-21
Accepted: 2015-1-22
Published Online: 2016-2-5

©2016 A. K. Bhuniya and Sudip Bera

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Scroll Up Arrow