Subgroup Sum Graphs of Finite Abelian Groups

Abstract

Let G be a finite abelian group, written additively, and H a subgroup of G. The subgroup sum graph \(\varGamma _{G,H}\) is the graph with vertex set G, in which two distinct vertices x and y are joined if \(x+y\in H{\setminus }\{0\}\). These graphs form a fairly large class of Cayley sum graphs. Among cases which have been considered previously are the prime sum graphs, in the case where \(H=pG\) for some prime number p. In this paper we present their structure and a detailed analysis of their properties. We also consider the simpler graph \(\varGamma ^+_{G,H}\), which we refer to as the extended subgroup sum graph, in which x and y are joined if \(x+y\in H\): the subgroup sum is obtained by removing from this graph the partial matching of edges having the form \(\{x,-x\}\) when \(2x\ne 0\). We study perfectness, clique number and independence number, connectedness, diameter, spectrum, and domination number of these graphs and their complements. We interpret our general results in detail in the prime sum graphs.