Subgroup sum graphs of finite abelian groups (Q2155991): Difference between revisions

Given a finite abelian group \(G\) and a subgroup \(H\), the subgroup sum graph \(\Gamma_{G,H}\) is a graph whose vertices are the elements of \(G\) and two distinct vertices \(x\) and \(y\) are connected by an edge whenever \(x+y\in H\setminus\{0\}\) (the operation of \(G\) is denoted by \(+\)). Previously, the case \(H=pG\) (\(p\) being a prime) was considered. Such graphs are called prime sum graphs. In this paper, their structure is investigated and a detailed analysis of their properties is presented. A simpler graph, called the extended subgroup graph is also studied. In this case, two distinct vertices \(x\) and \(y\) are connected by an edge whenever \(x+y\in H\). Perfectness, clique number and independence number, connectedness, diameter, spectrum, and the domination number of these graphs and their complements are investigated.