Subgroup sum graphs of finite abelian groups

From MaRDI portal
Publication:2155991




Abstract: Let G be a finite abelian group, written additively, and H a subgroup of~G. The emph{subgroup sum graph} GammaG,H is the graph with vertex set G, in which two distinct vertices x and y are joined if x+yinHsetminus0. These graphs form a fairly large class of Cayley sum graphs. Among cases which have been considered previously are the emph{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 GammaG,H+, which we refer to as the emph{extended subgroup sum graph}, in which x and y are joined if x+yinH: the subgroup sum is obtained by removing from this graph the partial matching of edges having the form x,x when 2xe0. 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.



Cites work







This page was built for publication: Subgroup sum graphs of finite abelian groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2155991)