Advanced search
Publication Cover
Communications in Algebra Volume 49, 2021 - Issue 3
Submit an article Journal homepage
181
Views
7
CrossRef citations to date
0
Altmetric
Research Article

Minimal cut-sets in the power graphs of certain finite non-cyclic groups

Sriparna Chattopadhyaya Department of Applied Science and Humanities, National Institute of Foundry and Forge Technology (NIFFT), Ranchi, Jharkhand, IndiaView further author information
,
Kamal Lochan Patrab School of Mathematical Sciences, National Institute of Science Education and Research (NISER), Bhubaneswar, Odisha, India;c Homi Bhabha National Institute (HBNI), Mumbai, IndiaView further author information
&
Binod Kumar Sahoob School of Mathematical Sciences, National Institute of Science Education and Research (NISER), Bhubaneswar, Odisha, India;c Homi Bhabha National Institute (HBNI), Mumbai, IndiaCorrespondence[email protected]
View further author information
Pages 1195-1211 | Received 20 Jan 2020, Accepted 11 Sep 2020, Published online: 16 Oct 2020

References

  • Abawajy, J., Kelarev, A., Chowdhury, M. (2013). Power graphs: a survey. EJGTA. 1(2):125–147. DOI: 10.5614/ejgta.2013.1.2.6.
  • Bondy, J. A., Murty, U. S. R. (2008). Graph Theory. Graduate Texts in Mathematics, Vol. 244. New York: Springer.
  • Chakrabarty, I., Ghosh, S., Sen, M. K. (2009). Undirected power graphs of semigroups. Semigroup For. 78(3):410–426. DOI: 10.1007/s00233-008-9132-y.
  • Chattopadhyay, S., Panigrahi, P. (2014). Connectivity and planarity of power graphs of finite cyclic, dihedral and dicyclic groups. Algebra Discrete Math. 18(1):42–49.
  • Chattopadhyay, S., Patra, K. L., Sahoo, B. K. (2019). Vertex connectivity of the power graph of a finite cyclic group. Discrete Appl. Math. 266:259–271. DOI: 10.1016/j.dam.2018.06.001.
  • Curtin, B., Pourgholi, G. R. (2014). Edge-maximality of power graphs of finite cyclic groups. J. Algebra Combin. 40(2):313–330. DOI: 10.1007/s10801-013-0490-5.
  • Curtin, B., Pourgholi, G. R. (2016). An Euler totient sum inequality. J. Number Theory. 163:101–113. DOI: 10.1016/j.jnt.2015.11.012.
  • Doostabadi, A., Farrokhi., Ghouchan, M. D. (2015). On the connectivity of proper power graphs of finite groups. Commun. Algebra 43(10):4305–4319. DOI: 10.1080/00927872.2014.945093.
  • Kelarev, A. V., Quinn, S. J. (2000). A combinatorial property and power graphs of groups. In Dorninger D., Eigenthaler G., Goldstern M., Kaiser H. K., More W., Müller W. B., eds. Contributions to General Algebra, Vol. 12 (Vienna, 1999). Klagenfurt: Heyn, pp. 229–235.
  • Kelarev, A. V., Quinn, S. J. (2002). Directed graphs and combinatorial properties of semigroups. J. Algebra 251(1):16–26. DOI: 10.1006/jabr.2001.9128.
  • Kelarev, A. V., Quinn, S. J., Smolíková, R. (2001). Power graphs and semigroups of matrices. Bull. Aust. Math. Soc. 63(2):341–344. DOI: 10.1017/S0004972700019390.
  • Mirzargar, M., Ashrafi, A. R., Nadjafi-Arani, M. J. (2012). On the power graph of a finite group. Filomat. 26(6):1201–1208. DOI: 10.2298/FIL1206201M.
  • Moghaddamfar, A. R., Rahbariyan, S., Shi, W. J. (2014). Certain properties of the power graph associated with a finite group. J. Algebra Appl. 13(07):1450040. DOI: 10.1142/S0219498814500406.
  • Panda, R. P., Krishna, K. V. (2018). On connectedness of power graphs of finite groups. J. Algebra Appl. 17(10):1850184. DOI: 10.1142/S0219498818501840.
  • Robinson, D. J. S. (1996). A course in the Theory of Groups. Graduate Texts in Mathematics, 2nd ed. New York: Springer-Verlag.
  • Rose, H. E. (2009). A Course on Finite Groups. London: Universitext, Springer-Verlag London, Ltd.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.