The complement subgroup product graph of a cyclic group
*Shakir Jawad AbdCorresponding authorshakirj.alhasnawi@student.uokufa.edu.iqDepartment of MathematicsFaculty of Computer Sciences and MathematicsUniversity of KufaKufa, Al Najaf, 540011, Iraq0000-0001-9550-0996View full profile → , Hayder Baqer Ameenhayder.ameen@uokufa.edu.iqDepartment of MathematicsFaculty of Computer Sciences and MathematicsUniversity of KufaKufa, Al Najaf, 540011, Iraq0000-0002-0324-740XView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 06 May 2024
- Published Online:
- 21 Mar 2025
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-2025
- Pages:
- 393–397
Abstract
Keywords
Subject Classifications
References
[1] S. J. Abd and H. B. Shelash, “On subgroups product graph of finite groups,” BIO Web Conf., vol. 97, p. 155 (2024).
[2] D. Angsuman, M. Saha, and S. Al-Kaseasbeh, “Subgroup Product Graph of a Group,” (2021). [Online]. Available: https://www.researchgate.net/publication/350456889_Subgroup_Product_Graph_of_a_Group.
[3] H. B. Shelash and A. R. Ashrafi, “The number of subgroups of a given type in certain finite groups,” Iran. J. Math. Sci. Informatics, vol. 16, no. 2, pp. 73-87 (2021).
[4] H. B. Shelash and A. R. Ashrafi, “Table of marks and character table of certain finite groups,” Quasigroups Relat. Syst., vol. 28, no. 1, pp. 159-170 (2020).
[5] H. R. Hashim, F. Luca, H. B. Shelash, and A. A. Shukur, “Generalized Lucas graphs,” Afrika Mat., vol. 34, no. 1, p. 10 (2023).
[6] R. Schmidt, Subgroup Lattices of Groups, vol. 14. Berlin, Germany: Walter de Gruyter (2011).
[7] The GAP Group, “GAP–Groups, Algorithms, and Programming,” no title. [Online]. Available: http://www.gap-system.org.
[8] I. M. Kadhim, H. J. Mehdi, W. M. Salah, and H. B. Ameen, “Computing the number of subgroups of group T4n×C2,” Math. Statist. Eng. Appl., vol. 71, no. 3s3, pp. 109-114 (2022). [Online]. Available: https://www.philstat.org.ph/index.php/MSEA/article/view/352.
[9] S. F. Mousavi, A. Gilani, M. Alaeiyan, and M. Golriz, “A characterization by the product element orders for some groups,” J. Inf. Optim. Sci., vol. 41, no. 4, pp. 1133-1139 (2020). [Online]. Available: https://doi.org/10.1080/02522667.2020.1745384.
[10] O. Zaka and M. A. Mohammed, “The endomorphisms algebra of translations group and associative unitary ring of trace-preserving endomorphisms in affine plane,” Proyecciones (Antofagasta, On line), vol. 39, no. 4, pp. 821-834 (2020). [Online]. Available: https://doi.org/10.22199/issn.0717-6279-2020-04-0051.
[11] O. Zaka and M. A. Mohammed, “Skew-field of trace-preserving endomorphisms of translation group in affine plane,” Proyecciones (Antofagasta, On line), vol. 39, no. 4, pp. 823-850 (2020). [Online]. Available: https://doi.org/10.22199/issn.0717-6279-2020-04-0052.
[12] T. Sahoo, M. D. Shetty, N. J. Groenewald, P. K. Harikrishnan, and S. P. Kuncham, “On completely 2-absorbing ideals of N-groups,” J. Discrete Math. Sci. Cryptogr., vol. 24, no. 2, pp. 541-556 (2021). [Online]. Available: https://doi.org/10.1080/09720529.2021.1892268.
[13] A. G. Algam and H. B. Shelash, “Dynamics of monad graph of finite group,” J. Discrete Math. Sci. Cryptogr., vol. 24, no. 6, pp. 1589-1593 (2021). [Online]. Available: https://doi.org/10.1080/09720529.2020.1790735.
[14] A. H. Alwan, “Small intersection graph of subsemimodules of a semimodule,” Commun. Combin. Cryptogr. Comput. Sci., vol. 2022, no. 1, pp. 15-22 (2022).
[15] S. Ediza, M. Cancana, and M. R. Farahani, “Eccentric connectivity and connective eccentricity indices of generalized Petersen graphs,” Commun. Combin. Cryptogr. Comput. Sci., vol. 2021, no. 1, pp. 1-6 (2021).
[16] R. Ponraj, S. Prabhu, and M. Sivakumar, “Pair mean cordial labeling of total graph of some graphs and prism related graphs,” Commun. Combin. Cryptogr. Comput. Sci., vol. 2024, no. 2, pp. 181-192 (2024).
[17] F. O. Oduol and I. O. Okoth, “Counting vertices among all noncrossing trees by levels and degrees,” Commun. Combin. Cryptogr. Comput. Sci., vol. 2024, no. 2, pp. 193-212 (2024).
