A zero-sum problem on graphs

MaRDI QIDQ6278632zbMATH OpenFDO

Authors Daniel Weißauer

Publication date 14 October 2016

Abstract: Call a graph $G$ zero-forcing for a finite abelian group $mathcalG$ if for every $ell:V(G)omathcalG$ there is a connected $AsubseteqV(G)$ with $su{m}_{ainA}ell(a)=0$. The problem we pose here is to characterise the class of zero-forcing graphs. It is shown that a connected graph is zero-forcing for the cyclic group of prime order $p$ if and only if it has at least $p$ vertices. When $|mathcalG|$ is not prime, however, being zero-forcing is intimately linked to the structure of the graph. We obtain partial solutions for the general case, discuss computational issues and present several questions.

This page was built for publication: A zero-sum problem on graphs

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