Subgroup sum graphs of finite abelian groups

DOI10.1007/S00373-022-02515-WMaRDI QIDQ2155991zbMATH OpenOpenAlexFDO

Authors Peter J. Cameron, R. Raveendra Prathap, T. Tamizh Chelvam

Publication date 15 July 2022

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2111.05748

zbMATH Keywords

Cayley graphschromatic numberclique numberfinite abelian groupspectrumsubgroup sum graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Finite abelian groups (20K01)

Abstract: Let $G$ be a finite abelian group, written additively, and $H$ a subgroup of~$G$. The emph{subgroup sum graph} $Gamm{a}_{G,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 $Gamm{a}_{G,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.

Review text

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.

Recommendations

• Subgroup perfect codes in Cayley sum graphs
• Subgroup intersection graph of finite abelian groups
• The subgroup graph of a group
• The complement of subgroup graph of a group
• On integral Cayley sum graphs

Cites work

• A classification of circulant DCI(CI)-digraphs of 2-power order
• A decomposition theorem for partially ordered sets
• Cayley graphs on abelian groups
• Cayley sum graphs and eigenvalues of \((3,6)\)-fullerenes
• Complement graph of the square graph of finite abelian groups
• Connectivity of addition Cayley graphs
• Domination in generalized unit and unitary Cayley graphs of finite rings
• Efficient dominating sets in Cayley graphs.
• Efficient open domination in Cayley graphs
• Generalized Cayley graphs associated to commutative rings
• Generalized unit and unitary Cayley graphs of finite rings
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 6704935 (Why is no real title available?)
• scientific article; zbMATH DE number 5053676 (Why is no real title available?)
• Independent domination number of Cayley graphs on \(\mathbb{Z}_n\)
• Independent perfect domination sets in Cayley graphs
• Integral Cayley graphs over Abelian groups
• Isomorphism of circulant graphs and digraphs
• Isomorphisms of circulant digraphs
• Line graphs, root systems, and elliptic geometry
• Normal hypergraphs and the perfect graph conjecture
• On subgraphs of random Cayley sum graphs
• On the connectedness of square element graphs over arbitrary rings
• On the nil-graph of ideals of commutative Artinian rings
• Power graph of finite abelian groups
• Simple groups are characterized by their non-commuting graphs
• Some properties of Square element graphs over semigroups
• Spectra of twists of Cayley and Cayley sum graphs
• Structure and substructure connectivity of circulant graphs and hypercubes
• Subgroups as efficient dominating sets in Cayley graphs
• The cubic power graph of finite abelian groups
• The power graph of a finite group
• THE SIGNED STAR DOMINATION NUMBER OF CAYLEY GRAPHS
• The square element graph over a finite commutative ring
• The square element graph over a ring
• Undirected power graphs of semigroups

Cited in

(7)

• The subgroup graph of a group
• Group-annihilator graphs realised by finite abelian groups and its properties
• The complement of subgroup graph of a group
• On independence polynomials of quotient based graphs for finite abelian groups
• Generalized non-coprime graphs of groups
• Subspace sum graphs over residue class rings
• Note on relative Cayley graphs of groups and its complement

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)