Centralizers in finite groups and Domination number of their commuting graphs

Sudip Bera, Hiranya Kishore Dey, Umang Jethva

The proper commuting graph ${\mathcal{C}}^{\ast \ast }(G)$ of a finite group $G$ is the simple graph whose vertices are the noncentral elements of $G$ and two distinct vertices are adjacent…