Abstract: Call a graph zero-forcing for a finite abelian group if for every there is a connected with . 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 if and only if it has at least vertices. When 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)
