On Commuting Graphs of Generalized Dihedral Groups
classification
🧮 math.CO
keywords
commutinggraphdihedralgeneralizedgroupsadjacentarticlebeen
read the original abstract
For a group $G$ and a subset $X$ of $G$, the commuting graph of $X$, denoted by $\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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.