arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2308.04548cs.DMmath.CO
收藏

斯巴达二部图本质上是初等的

Spartan Bipartite Graphs are Essentially Elementary

Neeldhara Misra, Saraswati Girish Nanoti

AI总结:

本文研究图上永恒顶点覆盖博弈,证明在每条边都属于某个完美匹配的2n顶点二部图中,斯巴达图本质上只能是那些可用n个守卫沿完美匹配防御攻击的图。

摘要:

我们研究攻击者与防御者之间在图上的双人博弈。开始时,防御者在顶点的一个子集上放置守卫。每一步中,攻击者攻击一条边。防御者必须将至少一个守卫沿被攻击的边移动以防御该攻击。当且仅当防御者能够防御无限长的攻击序列时,防御者获胜。防御者拥有获胜策略所需的最少守卫数称为图$G$的永恒顶点覆盖数,记作$evc(G)$。显然$evc(G)$至少为$mvc(G)$,即$G$的最小顶点覆盖的大小。若$evc(G) = mvc(G)$,则称$G$是斯巴达的。斯巴达图的刻画在很大程度上仍是未解问题。在具有$2n$个顶点且每条边都属于一个完美匹配的二部图情形下,一个简单的策略是放置$n$个守卫,使其始终沿完美匹配移动以响应攻击。我们证明这些图本质上是仅有的斯巴达二部图。

英文摘要:

We study a two-player game on a graph between an attacker and a defender. To begin with, the defender places guards on a subset of vertices. In each move, the attacker attacks an edge. The defender must move at least one guard across the attacked edge to defend the attack. The defender wins if and only if the defender can defend an infinite sequence of attacks. The smallest number of guards with which the defender has a winning strategy is called the eternal vertex cover number of a graph $G$ and is denoted by $evc(G)$. It is clear that $evc(G)$ is at least $mvc(G)$, the size of a minimum vertex cover of $G$. We say that $G$ is Spartan if $evc(G) = mvc(G)$. The characterization of Spartan graphs has been largely open. In the setting of bipartite graphs on $2n$ vertices where every edge belongs to a perfect matching, an easy strategy is to have $n$ guards that always move along perfect matchings in response to attacks. We show that these are essentially the only Spartan bipartite graphs.

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

↑