Commuting graphs on Coxeter groups, Dynkin diagrams and finite subgroups of $SL(2,\mathbb{C})$

Umar Hayat, Álvaro Nolla de Celis, Fawad Ali

For a group $H$ and a non empty subset $\Gamma \subseteq H$, the commuting graph $G=\mathcal{C}(H,\Gamma )$ is the graph with $\Gamma$ as the node set and where any $x,y\in \Gamma$ are joined by an edg…