A note on hamiltonicity conditions of the coprime and non-coprime graphs of a finite group
DOI:
https://doi.org/10.25077/jmua.13.3.157-162.2024Keywords:
Coprime Graph, Non-coprime Graph, Hamiltonian GraphAbstract
Let $G$ be a group. The coprime and non-coprime graphs of $G$ are introduced by Ma et al. (2014) and Mansoori et al. (2016), respectively, when $G$ is finite. By their definitions, which refer to coprime and non-coprime terms of two positive integers, those graphs must be related. We prove that they are closely related through their graph complement and preserve the isomorphism groups. Furthermore, according to Cayley's theorem, which states that any group $G$ is isomorphic to a subgroup of the symmetric group on $G$, it implies that the studies of the coprime and non-coprime graphs of any group $G$ (especially, when $G$ is finite) can actually be represented by the coprime and non-coprime graphs of any subgroup of the symmetric group on $G$. This encourages us to specifically study the hamiltonicity of both kinds of graphs associated with $G$ when $G$ is isomorphic to the symmetric group on $G$.References
Ma, X., Wei, H., Yang, L., 2014, The coprime graph of a group, textit{International Journal of Group Theory}, Vol. textbf{3} (3) : 13-23.
Mansoori, F., Erfanian, A., Tolue, B., 2016, Non-coprime graph of a finite group, in textit{AIP Conference Proceedings}, Vol. textbf{1750} (1) (AIP Publishing, 2016), https://doi.org/10.1063/1.4954605
Adkins, W.A., Weintraub S.H., 1992, textit{Algebra: An Approach Via Module Theory}, Springer-Verlag, New York.
Rhani, N.A., Ali, N.M.M., Sarmin, N.H., Erfanian, A., 2017, On the dominating number, independent number and the regularity of the relative co-prime graph of a group, textit{Malaysian Journal of Fundamental and Applied Sciences}, Vol. textbf{13} (2) : 72-74, https://doi.org/10.11113/mjfas.v13n2.602
Rajkumar, R., Devi, P., 2015, Coprime graph of subgroups of a group, textit{Arxiv: Group Theory}, https://doi.org/10.48550/arXiv.1510.00129
Erdős, P., Sarkozy, G.N., 1997, On cycles in the coprime graph of integers, textit{Electron. J. Combin.}, Vol. textbf{4} (2), https://doi.org/10.37236/1323
Mostafa, M.H.B., Ghorbani, E., 2021, Hamiltonicity of a coprime graph, textit{Graphs and Combinatorics}, Vol. textbf{37} : 2387-2395.
Mutharasu, S., Rilwan, N.M., Jebitha, M.K.A., Chelvam, T.T., 2014, On generalized coprime graphs, textit{Iranian Journal of Mathematical Sciences and Informatics}, Vol. textbf{9} (2) : 1-6, https://dx.doi.org/10.7508/ijmsi.2014.02.001
Kathirvel, S.A., Cameron, P.J., Chelvam, T.T., 2024, Generalized non-coprime graphs of groups, textit{J. Algebraic Combin.}, https://doi.org/10.1007/s10801-024-01310-5
Huda, M.N., Ali, S., Non-coprime graph energy of dihedral and symmetric group, to appear in textit{AIP Conference Proceedings of The 9th SEAMS-UGM} (AIP Publishing).
Downloads
Additional Files
Published
Issue
Section
License
All articles published in Jurnal Matematika UNAND (JMUA) are open access and licensed under the Creative Commons Attribution-ShareAlike (CC BY-SA) license. This ensures that the content is freely available to all users and can be shared and adapted, provided appropriate credit is given and any adaptations are distributed under the same license.
Copyright Holder
The copyright of all articles published in Jurnal Matematika UNAND is held by the Departemen Matematika dan Sains Data, Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA), Universitas Andalas (UNAND). This applies to all published versions, including the HTML and PDF formats of the articles.
Author Rights
While the Departemen Matematika dan Sains Data FMIPA UNAND holds the copyright for all published content, authors retain important rights under the Creative Commons Attribution-ShareAlike 4.0 International License (CC BY-SA). This license grants authors and users the following rights:
- Reuse: Authors can reuse and distribute their work for any lawful purpose, including sharing on personal websites, institutional repositories, or in subsequent publications.
- Attribution and Adaptation: Authors and others may remix, adapt, and build upon the published work for any purpose, even commercially, as long as proper credit is given to the original authors, and any derivative works are distributed under the same CC BY-SA license.
Creative Commons License (CC BY-SA)
Under the terms of the CC BY-SA license, users are free to:
- Share: Copy and redistribute the material in any medium or format.
- Adapt: Remix, transform, and build upon the material for any purpose, even commercially.
However, the following conditions apply:
- Attribution: Users must give appropriate credit to the original author(s) and Departemen Matematika dan Sains Data FMIPA UNAND, provide a link to the license, and indicate if changes were made. Attribution must not imply endorsement by the author or the journal.
- ShareAlike: If users remix, transform, or build upon the material, they must distribute their contributions under the same license as the original.
For more information about the CC BY-SA license, please visit the Creative Commons website.
Third-Party Content
If authors include third-party material (such as figures, tables, or images) that is not covered by a Creative Commons license, they must obtain the necessary permissions for reuse and provide proper attribution. Authors are required to ensure that any third-party content complies with open-access licensing requirements or includes permissions for redistribution under similar terms.
Copyright and Licensing Information Display
The copyright and licensing terms will be clearly displayed on each article's landing page, as well as within the full-text versions (HTML and PDF) of all published articles.
No "All Rights Reserved"
As an open-access journal, JMUA does not use "All Rights Reserved" policies. Instead, the CC BY-SA license ensures that the works remain accessible and reusable for a wide audience while still protecting both the authors' and the copyright holder's rights.
Â
