The independence graph of a finite group (Q2204727)

This paper studies the properties of generating graphs of a finite group. Let \(G\) be a finite group. Then the generating graph is defined on the elements of \(G\) such that for any two vertices \(x,y\) (distinct) are adjacent iff they generate \(G.\) It was defined by \textit{M. W. Liebeck} and \textit{A. Shalev} [J. Algebra 184, No. 1, 31--57 (1996; Zbl 0870.20014)]. Later it was studied by various authors such as T. Breuer, A . Lucchini, R. M. Guralnick, P. J. Cameron and many more. There are various invariants associated with the generating graph. Many mathematicians have studied invariants associated with generated graphs such as the clique number, the chromatic number and so on. Clearly generated graphs are edgeless when \(G\) is not 2-generated. So it is a definitely very natural idea to propose and investigate a possible generalization of it, that gives useful information even when \(G\) is not \(2\)- generated. For a given finite group \(G,\) consider \(\Gamma (G)\) to be the graph whose vertices are the elements of \(G\) and any two distinct vertices \(x,y\) are adjacent iff there exists a minimal generating set of \(G\) containing \(x,y.\) If we consider the non-isolated vertices of \(\Gamma (G)\), then the corresponding subgraph of \(\Gamma (G)\) is denoted by \(\Delta (G).\) This paper investigates about the subgraph \(\Delta (G)\) and proved two important properties of it. First of all, this study confirms that the subgraph \(\Delta(G)\) is a connected graph for any finite group \(G\) and it classifies the groups \(G\) for which \(\Delta(G)\) is planar. This study also raises some interesting questions regarding such generalized generated graphs. One of such is to classify the group \(G\) for which \(\Delta (G)\) is Hamiltonian. A similar kind of questions will arise if one considers the minimal generating set to be of some particular size.