For a finite group different from a cyclic group of prime power order, we introduce an undirected simple graph whose vertices are the proper subgroups of which are not contained in the Frattini subgroup of and two vertices and are joined by an edge if and only if . In this paper we study and show that it is connected and determine the clique and chromatic number of and obtain bounds for its diameter and girth. We classify finite groups with complete graphs and also classify finite groups with domination number 1. Also we show that if the independence number of the graph is at most 7, then is solvable.
Cite this article
Hadi Ahmadi, Bijan Taeri, A graph related to the join of subgroups of a finite group. Rend. Sem. Mat. Univ. Padova 131 (2014), pp. 281–292