arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1610.04407math.CO
收藏

图上的零和问题

A zero-sum problem on graphs

Daniel Weißauer

摘要:

如果对每个$\ell : V(G) \to \mathcal{G}$都有一个连通的$A \subseteq V(G)$与$\sum_{a \in A} \ell(a) = 0$,则称一个图$G$为有限阿贝尔群$\mathcal{G}$的迫零图。我们在这里提出的问题是证明迫零图类。证明了素数阶循环群$p$的连通图是迫零的当且仅当它至少有$p$顶点.然而,当$|\mathcal{G}|$不是素数时,迫零与图的结构密切相关。我们获得部分解决方案的一般情况下,讨论计算问题,并提出了几个问题。

英文摘要:

Call a graph $G$ zero-forcing for a finite abelian group $\mathcal{G}$ if for every $\ell : V(G) \to \mathcal{G}$ there is a connected $A \subseteq V(G)$ with $\sum_{a \in A} \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 $|\mathcal{G}|$ 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑