On Commuting Graphs of Generalized Dihedral Groups

For a group $G$ and a subset $X$ of $G$, the commuting graph of $X$, denoted by $\mathrm{\Gamma }(G,X)$ is the graph whose vertex set is $X$ and any two vertices $u$ and $v$ in $X$ are adjacent if and only if they commute in $G$. In this article, certain properties of the commuting graph of generalized dihedral groups have been studied.