\documentclass{template-jurnal} %Bagian ini diedit oleh editor Jurnal Matematika UNAND \hyphenation{di-tulis-kan di-terang-kan} %Perhatikan aturan penulisan dan ukuran huruf yang digunakan \begin{document} \markboth{Muhammad Nurul Huda} %Jika lebih dari dua penulis, tuliskan sebagai Nama Penulis Pertama dkk. {A note on hamiltonicity conditions of the coprime and non-coprime graphs of a finite group} %%%%%%%%%%%%%%%%%%%%% Publisher's Area please ignore %%%%%%%%%%%%%%% % \catchline{}{}{}{}{} % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \title{A NOTE ON HAMILTONICITY CONDITIONS OF THE COPRIME AND NON-COPRIME GRAPHS OF A FINITE GROUP} \author{MUHAMMAD NURUL HUDA} \address{Department of Mathematics, Universitas Gadjah Mada, Indonesia.\\ email : \email{muhammadnurulhuda2000@mail.ugm.ac.id}} \maketitle \setcounter{page}{1} %bagian ini diedit oleh editor Jurnal Matematika UNAND \begin{abstract} \begin{center} Accepted ..... \quad Revised ..... \quad Published ..... %tanggal-tanggal tersebut \textbf{dikosongkan} saja \end{center} \bigskip \textbf{Abstract}. % Dalam bahasa Inggris \textit{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 almost isomorphically 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$.} \end{abstract} \keywords{Coprime Graph, Non-coprime Graph, Hamiltonian Graph.} \section{Introduction} Throughout this paper, we assume that $G$ and $e_{G}$ are a finite group and its identity element, respectively. The order of $G$ and element $x$ of $G$ are the number of elements of $G$ and the smallest positive integer $r$ such that $x^{r}=e_{G}$, respectively. In terms of a symmetric group on a given set $X$, denoted by $\mathfrak{S}_{|X|}$, we write $$\mathfrak{S}_{|X|}=\{f:X\longrightarrow X|~f~\text{is a bijection (a permutation) on}~X\}.$$ The element (or permutation) is represented as a cycle $(a_{1}~a_{2}~\dots~a_{k})$ of length $k$. We refer to the following lemma that will be used later. \begin{lemma}\label{sumber 1}\rm{\cite{huda}} \textit{Let $p_{1},\dots,p_{N}$ be prime numbers less than or equal to $|G|$. For any $m=\prod_{i=1}^{N}p_{i}^{\alpha_{i}}$ dividing $|G|!$ such that $\sum_{i=1}^{N}p_{i}^{\alpha_{i}}\leq |G|$, there exists $\sigma\in\mathfrak{S}_{|G|}$ whose order $m$.} \end{lemma} In addition, all graphs in this paper are assumed to be simple, undirected, and finite. Let $\Gamma$ be a graph where $V(\Gamma)$ and $E(\Gamma)$ are the vertex set and the edge set of $\Gamma$, respectively. Specific $\Gamma$ where $E(\Gamma)=\emptyset$ is called a null graph, denoted by $N_{|V(\Gamma)|}$. A path and cycle in $\Gamma$ are a list of $m$ distinct vertices that are written as $v_{k_{1}}-v_{k_{2}}-\dots-v_{k_{m}}$ and $v_{k_{1}}-v_{k_{2}}-\dots-v_{k_{m}}-v_{k_{1}}$, respectively, where $v_{k_{i}}\in V(\Gamma)$ for all $i\in\{1,2,\dots,m\}$ and the symbol '$-$' between two vertices describes that those vertices are adjacent. The length of a path and cycle is the number of edges (or symbol '$-$') of the path and cycle. Graph $\Gamma$ is said to be connected if there exists a path joining any two distinct vertices in $\Gamma$. Also, $\Gamma$ is said to be Hamiltonian if $\Gamma$ contains a Hamiltonian cycle, which is a cycle of length $|V(\Gamma)|$. The complement of $\Gamma$, denoted by $\overline{\Gamma}$, is a graph where $V(\overline{\Gamma})=V(\Gamma)$ and two vertices are adjacent in $\overline{\Gamma}$ if and only if they are not adjacent in $\Gamma$. A join graph of $\Gamma_{1}$ and $\Gamma_{2}$, denoted by $\Gamma_{1}+\Gamma_{2}$, is a graph where $V(\Gamma_{1}+\Gamma_{2})=V(\Gamma_{1})\cup V(\Gamma_{2})$ and all vertices of $\Gamma_{1}$ are adjacent to all vertices of $\Gamma_{2}$. Let $\Gamma'$ be a subgraph of $\Gamma$. A removal graph $\Gamma'$ of $\Gamma$, denoted by $\Gamma-\Gamma'$, is a graph where $V(\Gamma-\Gamma')=V(\Gamma)\backslash V(\Gamma')$ and $E(\Gamma-\Gamma')=E(\Gamma)\backslash \left(E(\Gamma')\cup \left\{uv~|~u\in V(\Gamma'),v\in V(\Gamma)\backslash V(\Gamma')\right\}\right)$. The independence number of $\Gamma$, denoted by $\alpha(\Gamma)$, is the maximum number of vertices of $\Gamma$ where they are not adjacent to each other. The clique number of $\Gamma$, denoted by $\omega(\Gamma)$, is the independence number of $\overline{\Gamma}$. In basic number theory, two positive integers are coprime if the greatest common divisor of them equals $1$. Otherwise, they are non-coprime (not coprime) if the greatest common divisor of them is greater than $1$. Paul Erdős and Gabor N. Sarkozy (1997) in \cite{erdos} studied cycles in a coprime graph of the set of integers. This graph continues being studied by some researchers such as \cite{mostafa}, \cite{mutharasu}. Its terminology has been developed by changing the set of integers to a finite group. A coprime graph of $G$ is a graph where $G$ is its vertex set and any two vertices are adjacent if and only if their orders are coprime, denoted by $C(G)$. It was introduced by Ma et al in \cite{ma} who also studied structural algebras earned from this graph. Some research regarding coprime graphs and the variations can be seen for example \cite{rhani}, \cite{rajkumar}. The authors of \cite{ma} prove that $C(D_{2n})$ is Hamiltonian if $n$ is odd and $C(D_{2n})$ is not Hamiltonian if $n$ is even. Algebraically, one has studied that $D_{2n}$ is isomorphic to $\left\leq \mathfrak{S}_{n}$ where $x=(1~2~3~\dots~n)$ and $y$ is a product of $\left\lfloor\frac{n}{2}\right\rfloor$ transpositions. In this discussion, we will prove the hamiltonicity conditions of $C(\mathfrak{S}_{n})$, which is provided in Theorem \ref{teorema Hamiltonian n=3} and Theorem \ref{teorema Hamiltonian coprime}. In the reverse case, a non-coprime graph of $G$ is a graph where $G\backslash\{e_{G}\}$ is its vertex set and any two vertices are adjacent if and only if their orders are non-coprime, denoted by $NC(G)$. This graph was introduced by Mansoori et al in \cite{erfanian} and studied by some researchers, see for example \cite{huda}. The authors of \cite{kathirvel} generalized this graph by respecting it to a fixed subgroup of $G$. Associated with $C(G)$, we realize that the number of vertices of $C(G)$ is one more than the number of vertices of $NC(G)$. By their definitions, we can guess that they associate with each other through the complement form and it is not in a full number of vertices. We will prove it in Theorem \ref{teorema utama 1} with a simple argument. \begin{theorem}\rm{\cite{ma}}\label{teorema isomorfisma coprime} \textit{For given finite groups $G$ and $H$, if $G\simeq H$, then $C(G)\simeq C(H)$.} \end{theorem} Recall the following Cayley's Theorem about any group $G'$. \begin{theorem}\rm{\cite{adkins}}\label{teorema cayley finite group} \textit{Any group $G'$ is isomorphic to a subgroup of $\mathfrak{S}_{|G'|}$.} \end{theorem} By Theorem \ref{teorema isomorfisma coprime} and Theorem \ref{teorema cayley finite group}, we can study the coprime graphs of any finite $G$ via the coprime graphs of any subgroup of the symmetric group on $G$. Not only Theorem \ref{teorema isomorfisma coprime}, but also we will prove in the further discussion section (which is Theorem \ref{teorema isomorfisma non-coprime}), that non-coprime graphs apply the same notion. We refer to the following theorem that will be used later. \begin{theorem}\label{sumber 2}\rm{\cite{huda}} \textit{Let $p$ be the largest prime number less than or equal to $|G|$. It follows that $NC(\mathfrak{S}_{|G|})$ is connected if and only if $|G|>p+1$.} \end{theorem} From Theorem \ref{sumber 2}, the connectedness of $NC(\mathfrak{S}_{|G|})$ with such condition of $|G|$ motivates us to prove the existence of a Hamiltonian cycle in $NC(\mathfrak{S}_{|G|})$. It will be proven in Theorem \ref{teorema Hamiltonian non coprime}. \section{Main Results} We first investigate the relationship between coprime and non-coprime graphs of finite groups. Consider the following theorem. \begin{theorem}\label{teorema utama 1} \textit{$C(G)=\overline{NC(G)}+N_{1}$ and $NC(G)=\overline{C(G)}-N_{1}$.} \end{theorem} \begin{proof} By definitions, clearly $V(C(G))=V(\overline{NC(G)})\cup\{e_{G}\}$ and $V(NC(G))=V(\overline{C(G)})\backslash\{e_{G}\}$. Take any two distinct non-identity elements $u,v$ of $G$. If their orders are coprime, then $u,v$ are adjacent in $C(G)$ or in $\overline{NC(G)}$. It follows that $E(C(G))=E(\overline{NC(G)})\cup \left(V(\overline{NC(G)})\times\{e_{G}\}\right)$. Therefore, $C(G)=\overline{NC(G)}+N_{1}$. With a similar way, if the orders of $u$ and $v$ are not coprime, then $u$ and $v$ are adjacent in $NC(G)$ or in $\overline{C(G)}$. It follows that $E(NC(G))=E(\overline{C(G)})\backslash\left\{ue_{G}~|~u\in V(NC(G))\right\}$. Therefore, $NC(G)=\overline{C(G)}-N_{1}$. \end{proof} \begin{theorem}\label{teorema isomorfisma non-coprime} \textit{For given finite groups $G$ and $H$, if $G\simeq H$, then $NC(G)\simeq NC(H)$.} \end{theorem} \begin{proof} The proof is straightforward from Theorem \ref{teorema isomorfisma coprime} and Theorem \ref{teorema utama 1}. \end{proof} From Theorem \ref{teorema utama 1}, we know that $C(G)$ is always connected since all vertices (non-identity elements) are joined by an edge to $e_{G}$, whereas $NC(G)$ is not (see in \cite{huda}). By simple observation, we obtain the following result. \begin{theorem}\label{teorema Hamiltonian n=3} \textit{$C(\mathfrak{S}_{3})$ is Hamiltonian.} \end{theorem} \begin{proof} Simply we see a Hamiltonian cycle as follows. $$e_{\mathfrak{S}_{3}}-(1~2)-(1~2~3)-(1~3)-(1~3~2)-(2~3)-e_{\mathfrak{S}_{3}}.$$ \end{proof} Consider the following property that deals with a Hamiltonian graph. \begin{lemma}\label{lema hamiltonian} \textit{If $\Gamma$ is Hamiltonian on $k$ vertices, then $\alpha(\Gamma)\leq\left\lfloor\frac{k}{2}\right\rfloor$.} \end{lemma} \begin{proof} Recall that a Hamiltonian graph on $k$ vertices contains a cycle of length $k$ and the independence number of a graph that contains the cycle of length $k$ (let's say, it is denoted by $C_{k}$) is equal to $\left\lfloor\frac{k}{2}\right\rfloor$. Let $A$ and $B$ be the independent set of $\Gamma$ and $C_{k}$, respectively. Since every subset having $2$ elements of $A$ is not an edge of $\Gamma$ then it is not an edge of $C_{k}$. Therefore, $A\subseteq B$ and it follows that $\alpha(\Gamma)=|A|\leq |B|=\left\lfloor\frac{k}{2}\right\rfloor$. \end{proof} \begin{lemma}\label{lema banyaknya element berorder genap} \textit{For all $n>3$, the number of elements of even order in $\mathfrak{S}_{n}$ is greater than $\frac{n!}{2}$.} \end{lemma} \begin{proof} Recall that the number of odd permutations of $\mathfrak{S}_{n}$ is $\frac{n!}{2}$ (from the complement of an alternating group $A_{n}$). Those permutations have even length so that they have even order. In fact, there are some even permutations that are written as the multiplication of cycles of even length for any $n>3$. Thus, the number of permutations of even order in $\mathfrak{S}_{n}$ is greater than $\frac{n!}{2}$ in this case. \end{proof} \begin{proposition}\label{proposisi bilangan independensi dan klik} \textit{For all $n>3$, it follows that $$\alpha\left(C(\mathfrak{S}_{n})\right),\omega\left(NC(\mathfrak{S}_{n})\right)>\frac{n!}{2}.$$} \end{proposition} \begin{proof} Clearly, all elements whose even order in $\mathfrak{S}_{n}$ are not adjacent to each other in $C(\mathfrak{S}_{n})$ but they are adjacent to each other in $NC(\mathfrak{S}_{n})$. Therefore, the proof is complete by Lemma \ref{lema banyaknya element berorder genap}. \end{proof} By Theorem \ref{teorema Hamiltonian n=3}, Lemma \ref{lema hamiltonian}, and Proposition \ref{proposisi bilangan independensi dan klik}, we derive the following theorem. \begin{theorem}\label{teorema Hamiltonian coprime} \textit{$C(\mathfrak{S}_{n})$ is Hamiltonian if and only if $n=3$.} \end{theorem} \begin{proof} The left-hand side has proved in Theorem \ref{teorema Hamiltonian n=3}. Conversely, let $C(\mathfrak{S}_{n})$ is Hamiltonian. Suppose that $n>3$. From Proposition \ref{proposisi bilangan independensi dan klik}, we obtain $\alpha(C(\mathfrak{S}_{n}))>\frac{n!}{2}$. It follows by Lemma \ref{lema hamiltonian}, $C(\mathfrak{S}_{n})$ is not Hamiltonian. It is a contradiction with the hypothesis. \end{proof} Consider the following lemma which asserts that the number of non-identity elements of $\mathfrak{S}_{n}$ with a given order, is greater than $1$. \begin{lemma}\label{lema permutasi} \textit{The number of non-identity elements of order $d$ in $\mathfrak{S}_{n}$ is greater than $1$.} \end{lemma} \begin{proof} Recall that the conjugacy class of $k$-cycles $(k>1)$ in $\mathfrak{S}_{n}$ consists of the elements of the same cycle form and two elements of $\mathfrak{S}_{n}$ with the same cycle form have the same order. These imply that the cardinality of the conjugacy class of $x\in\mathfrak{S}_{n}$ determines the least number of elements whose the same order with $x$. Furthermore, the cardinality of the conjugacy class of $x\in G$ is equal to $1$ if and only if the center of $G$ only consists of $e_{G}$ (whose order $1$). Since the center of $\mathfrak{S}_{n}$ is not only consist of $e_{\mathfrak{S}_{n}}$ then the cardinality of the conjugacy class of an element of order $d>1$ is not equal to $1$. \end{proof} %\begin{lemma}\label{lema hamiltonian komplemen} % If $\Gamma$ is a Hamiltonian graph on $n\geq 5$ vertices, then $\overline{\Gamma}$ is also a Hamiltonian graph. %\end{lemma} %\begin{proof} % Let $V(\Gamma)=\{v_{i}:i\in[n]\}$. Since $\Gamma$ is a Hamiltonian graph on $n$ vertices then it contains a cycle of length $n$. By relabeling on its vertices, we say $x_{1}-x_{2}-\dots-x_{n}$ is the cycle of length $n$ in $\Gamma$. Since $n\geq 5$ then we find a new cycle of length $n$ in $\overline{\Gamma}$, that are $$x_{1}-x_{3}-x_{5}-\dots-x_{n-1}-x_{2}-x_{4}-\dots-x_{n-1}-x_{1}$$ if $n$ is odd and $$x_{1}-x_{3}-x_{5}-\dots-x_{n-1}-x_{2}-x_{4}-\dots-x_{n}-x_{1}$$ if $n$ is even. Therefore, $\overline{\Gamma}$ is also a Hamiltonian graph. %\end{proof} %\begin{Theorem}\label{teorema kehamiltonianan NC dan C} % For any $n\geq 3$, $NC(G)$ is a Hamiltonian graph if and only if $C(G)$ is also a Hamiltonian graph. %\end{Theorem} %\begin{proof} % Since $n\geq 3$ then $n!-1\geq 5$. By lemma \ref{lema hamiltonian komplemen}, if $NC(G)$ and $C(G)$ are Hamiltonian graphs, then both $\overline{C(G)}$ and $\overline{NC(G)}$ are also Hamiltonian graphs. By Theorem \ref{teorema utama 1}, we obtain the claim. %\end{proof} Using Theorem \ref{sumber 2}, Lemma \ref{lema permutasi}, and Lemma \ref{sumber 1}, we obtain the following theorem that provides hamiltonicity of connected non-coprime graph of $\mathfrak{S}_{n}$. \begin{theorem}\label{teorema Hamiltonian non coprime} \textit{The connected $NC(\mathfrak{S}_{n})$ is Hamiltonian.} \end{theorem} \begin{proof} Let $p_{\max}$ be the largest prime number less than or equal to $n$. By Theorem \ref{sumber 2}, $NC(\mathfrak{S}_{n})$ is connected if and only if $n>p_{\max}+1$. Clearly, $n$ must be greater than or equal to $9$. Let $p$ be any prime number less than $n$. Define $H_{p}$ to be the set of all elements having order divisible by $p$. Since for any $p$ satisfies $p$ divides $n!$ then by Lemma \ref{sumber 1}, there exists $\sigma\in\mathfrak{S}_{n}$ whose order $p$ and thus $\sigma\in H_{p}$. In other words, $H_{p}\neq\emptyset$ for all $p$. Now, define $\mathbb{H}_{2}=H_{2}$ and $$\mathbb{H}_{p}=H_{p}\backslash\bigcup_{\substack{\text{prime}~p'\\ 2\leq p'p_{\max}+1$ then $2+p_{i}\leq n$ for all $p_{i}\in\{2,p_{1},p_{2},\dots,p_{\max}\}$. By Lemma \ref{lema permutasi} and Lemma \ref{sumber 1}, there exist positive integers $\gamma,\gamma_{1},\gamma_{2},\dots,\gamma_{\max}>1$ which represent the number of elements in $\mathfrak{S}_{n}$ of order $2,2p_{1},2p_{2},\dots,2p_{\max}$, respectively. By definition of the non-coprime graph of $\mathfrak{S}_{n}$, all of those elements are adjacent to each other. Consider the following algorithm to construct a Hamiltonian cycle in $NC(\mathfrak{S}_{n})$. \begin{enumerate} \item[\rm{(i)}.] Relabel the elements of $\mathfrak{S}_{n}$ based on their order such as $x^{(i)}_{j}$ meaning an $i$th element of order $j$ in $\mathfrak{S}_{n}$. We set a path $\pi$ starting at $x^{(1)}_{2}$ and then goes to $x^{(1)}_{2p_{1}}$. \item[\rm{(ii)}.] From $x^{(1)}_{2p_{1}}$, $\pi$ goes to traverse all elements in $\mathbb{H}_{p_{1}}$ and then it goes back to $x^{(2)}_{2p_{1}}$ in $\mathbb{H}_{2}$. \item[\rm{(iii)}.] From $x^{(2)}_{2p_{1}}$, $\pi$ goes to $x^{(1)}_{2p_{2}}$. \item[\rm{(iv)}.] From $x^{(1)}_{2p_{2}}$, $\pi$ goes to traverse all elements in $\mathbb{H}_{p_{2}}$ and then it goes back to $x^{(2)}_{2p_{2}}$ in $\mathbb{H}_{2}$. \item[\rm{(v)}.] From $x^{(2)}_{2p_{2}}$, $\pi$ goes to $x^{(1)}_{2p_{3}}$. \item[\rm{(vi)}.] From $x^{(1)}_{2p_{3}}$, $\pi$ goes to traverse all elements in $\mathbb{H}_{p_{3}}$ and then it goes back to $x^{(2)}_{2p_{3}}$ in $\mathbb{H}_{2}$. \item[\rm{(vii)}.] Do the same procedures as above until $\pi$ traverse all elements in $\mathbb{H}_{p_{\max}}$ and then goes back to $x^{(2)}_{2p_{\max}}$ in $\mathbb{H}_{2}$. \item[\rm{(viii)}.] From $x^{(2)}_{2p_{\max}}$, $\pi$ goes to traverse the remaining elements in $\mathbb{H}_{2}$ such as $x^{(3)}_{2p_{i}},x^{(4)}_{2p_{i}},\dots,x^{(\gamma_{i})}_{2p_{i}}$ for each $i$ and then it ends at $x^{(1)}_{2}$. \item[\rm{(ix)}.] Therefore, we obtain $\pi$ as a Hamiltonian cycle in $NC(\mathfrak{S}_{n})$. \end{enumerate} % Since $NC(\mathfrak{S}_{n})$ is a Hamiltonian graph then by Lemma \ref{lema hamiltonian komplemen}, $\overline{NC(\mathfrak{S}_{n})}$ is also a Hamiltonian graph. Without loss of generality, it contains a cycle of length $n!-1$, i.e. $$x_{1}-x_{2}-\dots-x_{n!-1}-x_{1}.$$ Since $e\in G$ is adjacent to $x_{i}$ for all $i\in[n!-1]$ then we get a cycle of length $n!$ in $C(\mathfrak{S}_{n})$, that is $$x_{1}-x_{2}-\dots-x_{n!-1}-e-x_{1}.$$ Thus, $C(\mathfrak{S}_{n})$ is also a Hamiltonian graph. The proof is completed. \end{proof} We collect the results from the previous discussions into the following theorem. \begin{theorem}\label{teorema utama} \textit{For any finite group $G$ such that $G\simeq\mathfrak{S}_{|G|}$, we have the following assertions: \begin{enumerate} \item[\rm{(i)}.] $C(G)$ is Hamiltonian if and only if $|G|=3$, and \item[\rm{(ii)}.] Let $p$ is the largest prime number less than or equal to $|G|$. It follows that $NC(G)$ is Hamiltonian if and only if $|G|>p+1$. \end{enumerate}} \end{theorem} \section{Conclusion} Especially for any finite group $G$ that is exactly isomorphic to the symmetric group on $G$, we have proved the hamiltonicity condition of $C(G)$ and $NC(G)$ in Theorem \ref{teorema utama}. Looking back to the introduction, the hamiltonicity condition of the coprime and non-coprime graphs of any finite group is completely studied after one can tackle the remaining cases i.e. hamiltonicity conditions of $C(G)$ and $NC(G)$ with $G\simeq H$ where $H$ be a proper subgroup of the symmetric group on $G$. \begin{thebibliography}{99} \bibitem[1]{ma} 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. \bibitem[2]{erfanian} 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 \bibitem[3]{adkins} Adkins, W.A., Weintraub S.H., 1992, \textit{Algebra: An Approach Via Module Theory}, Springer-Verlag, New York. \bibitem[4]{rhani} 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 \bibitem[5]{rajkumar} Rajkumar, R., Devi, P., 2015, Coprime graph of subgroups of a group, \textit{Arxiv: Group Theory}, https://doi.org/10.48550/arXiv.1510.00129 \bibitem[6]{erdos} 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 \bibitem[7]{mostafa} Mostafa, M.H.B., Ghorbani, E., 2021, Hamiltonicity of a coprime graph, \textit{Graphs and Combinatorics}, Vol. \textbf{37} : 2387-2395. \bibitem[8]{mutharasu} 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, http://dx.doi.org/10.7508/ijmsi.2014.02.001 \bibitem[9]{kathirvel} 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 \bibitem[10]{huda} 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). \end{thebibliography} \end{document}