M. Sen

Generalized Graph Compositions with Applications to Difference Graphs of Finite Groups

The difference graph $D(G)$ of a finite group $G$ is obtained from the edge difference between its intersection power graph and power graph, after deleting isolated vertices. This graph has already been studied, with sufficient conditions for connectedness and a diameter bound $6$ for finite groups satisfying those con...