188
Views
7
CrossRef citations to date
0
Altmetric
Articles

Perfect codes in proper reduced power graphs of finite groups

ORCID Icon
Pages 3881-3890 | Received 03 Aug 2019, Accepted 26 Mar 2020, Published online: 14 Apr 2020

References

  • Aalipour, G., Akbari, S., Cameron, P. J., Nikandish, R., Shaveisi, F. (2017). On the structure of the power graph and the enhanced power graph of a group. Electron. J. Combin. 24(3):P3.16.
  • Abawajy, J., Kelarev, A. Chowdhury, M. (2013). Power graphs: a survey. Electron. J. Graph Theory Appl. 1(2):125–147. DOI: 10.5614/ejgta.2013.1.2.6.
  • Anitha, T., Rajkumar, R. (2019). On the power graph and the reduced power graph of a finite group. Commun. Algebra 47(8):3329–3339. DOI: 10.1080/00927872.2018.1555842.
  • Anitha, T., Rajkumar, R. (2020). Characterization of groups with planar, toroidal or projective planar (proper) reduced power graphs. J. Algebra Appl. DOI: 10.1142/s0219498820500991.
  • Bera, S., Bhuniya, A. K. (2018). On enhanced power graphs of finite groups. J. Algebra Appl. 17(08):1850146. DOI: 10.1142/S0219498818501463.
  • Brauer, R., Fowler, K. A. (1955). On groups of even order. Ann. Math. 62:567–583.
  • Bubboloni, D., Iranmanesh, M. A., Shaker, S. M. (2017). Quotient graphs for power graphs. Rend. Sem. Mat. Univ. Padova. 138:61–89. DOI: 10.4171/RSMUP/138-3.
  • Cameron, P. J. (2010). The power graph of a finite group. J. Group Theory II:779–783.
  • Cameron, P. J., Ghosh, S. (2011). The power graph of a finite group. Discrete Math. 311(13):1220–1222. DOI: 10.1016/j.disc.2010.02.011.
  • Chakrabarty, I., Ghosh, S., Sen, M. K. (2009). Undirected power graphs of semigroups. Semigroup Forum. 78(3):410–426. DOI: 10.1007/s00233-008-9132-y.
  • Dejter, I. J., Serra, O. (2003). Efficient dominating sets in Cayley graphs. Discrete Appl. Math. 129(2-3):319–328. DOI: 10.1016/S0166-218X(02)00573-5.
  • Feng, R., Huang, H., Zhou, S. (2017). Perfect codes in circulant graphs. Discrete Math. 340(7):1522–1527. DOI: 10.1016/j.disc.2017.02.007.
  • Feng, M., Ma, X., Wang, K. (2015). The structure and metric dimension of the power graph of a finite group. Eur. J. Combin. 43:82–97. DOI: 10.1016/j.ejc.2014.08.019.
  • Gavlas, H., Schultz, K., Slater, P. (1994). Efficient open domination in graphs. Sci. Ser. A Math. Sci. 154:77–84.
  • Ghidewon, A.-A., Hammack, R. H., Taylor, D. T. (2008). Total perfect codes in tensor products of graphs. Ars Combin. 88:129–134.
  • Gorenstein, D. (1980). Finite Groups. New York: Chelsea Publishing Co.
  • Heden, O. (2008). A survey of perfect codes. Adv. Math. Commun. 2(2):223–247. DOI: 10.3934/amc.2008.2.223.
  • Huang, H., Xia, B., Zhou, S. (2018). Perfect codes in Cayley graphs. SIAM J. Discrete Math. 32(1):548–559. DOI: 10.1137/17M1129532.
  • Johnson, D. L. (1980). Topics in the Theory of Group Presentations, London Math. Soc. Lecture Note Ser., Vol. 42. Cambridge-New York: Cambridge University Press.
  • Kelarev, A. V. (2002). Ring Constructions and Applications. River Edge, NJ: World Scientific.
  • Kelarev, A. V. (2003). Graph Algebras and Automata. New York: Marcel Dekker.
  • Kelarev, A. V. (2004). Labelled Cayley graphs and minimal automata. Aust. J. Combin. 30:95–101.
  • Kelarev, A. V., Quinn, S. J. (2000). A combinatorial property and power graphs of groups. Contrib. Gen. Algebra 12: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., Ryan, J., Yearwood, J. (2009). Cayley graphs as classifiers for data mining: the influence of asymmetries. Discrete Math. 309(17):5360–5369. DOI: 10.1016/j.disc.2008.11.030.
  • Kratochvíl, J. (1986). Perfect codes over graphs. J. Combin. Theory Ser. B. 40(2):224–228. DOI: 10.1016/0095-8956(86)90079-1.
  • Lee, J. (2001). Independent perfect domination sets in Cayley graphs. J. Graph Theory 37(4):213–219. DOI: 10.1002/jgt.1016.
  • Ma, X., Feng, M., Wang, K. (2017). The power index of a graph. Graphs Combin. 33(5):1381–1391. DOI: 10.1007/s00373-017-1851-y.
  • Ma, X., Feng, M., Wang, K. (2018). The strong metric dimension of the power graph of a finite group. Discrete Appl. Math. 239:159–164. DOI: 10.1016/j.dam.2017.12.021.
  • Ma, X., Fu, R., Lu, X., Guo, M., Zhao, Z. (2017). Perfect codes in power graphs of finite groups. Open Math. 15:1440–1449.
  • Ma, X., Walls, G. L., Wang, K. (2019). Power graphs of (non)orientable genus two. Commun. Algebra 47(1):276–288. DOI: 10.1080/00927872.2018.1476522.
  • 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.
  • Mollard, M. (2011). On perfect codes in Cartesian products of graphs. Eur. J. Combin. 32(3):398–403. DOI: 10.1016/j.ejc.2010.11.007.
  • Rajkumar, R., Anitha, T. (2017). Reduced power graph of a group. Electron. Notes Discrete Math. 63:69–76. DOI: 10.1016/j.endm.2017.10.063.
  • Rajkumar, R., Anitha, T. Some results on the reduced power graph of a group. Southeast Asian Bull. Math. arXiv:1804.00728v2.
  • van Lint, J. H. (1975). A survey of perfect codes. Rocky Mt. J. Math. 5(2):199–224. DOI: 10.1216/RMJ-1975-5-2-199.
  • Žerovnik, J. (2008). Perfect codes in direct products of cycles – a complete characterization. Adv. Appl. Math. 41(2):197–205. DOI: 10.1016/j.aam.2007.04.006.
  • Zhou, S. (2016). Total perfect codes in Cayley graphs. Des. Codes Cryptogr. 81(3):489–504. DOI: 10.1007/s10623-015-0169-0.

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:

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:

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.