图的联与笛卡儿积的愚人接龙
Fool's Solitaire on Joins and Cartesian Products of Graphs
摘要:
Peg Solitaire是Beeler和Hoilman在连通图上推广的一个博弈。在游戏中,除了一个顶点之外,所有的顶点都被钉上。如果$xyz$形成一个3顶点路径,并且$x$和$y$都有一个peg,但$z$没有,那么我们可以删除$x$和$y$处的peg,并在$z$处放置一个peg。通过与原始游戏中的动作类比,这被称为跳跃。图上的挂钩纸牌游戏的目标是找到将图上的挂钩数量减少到1的跳跃。Beeler和Rodriguez提出了一个变体,当不能再进行跳跃时,我们希望最大化剩余的钉住数。在单个孔的所有初始位置上最大化,当没有跳跃剩余时,图$G$上剩余的最大钉数是傻瓜纸牌数$F(G)$。我们确定了任何图$G$和$H$的连接的傻瓜纸牌数。对于carbohydrate产品,我们确定$F(G \Box K_k)$时,$k \ge 3$和$G$是连接的,并显示为什么我们的论点失败时,$k=2$。最后给出了图$G$和$H$隐含$F(G \Box H) \ge F(G) F(H)$的条件.
英文摘要:
Peg solitaire is a game generalized to connected graphs by Beeler and Hoilman. In the game pegs are placed on all but one vertex. If $xyz$ form a 3-vertex path and $x$ and $y$ each have a peg but $z$ does not, then we can remove the pegs at $x$ and $y$ and place a peg at $z$. By analogy with the moves in the original game, this is called a jump. The goal of the peg solitaire game on graphs is to find jumps that reduce the number of pegs on the graph to 1. Beeler and Rodriguez proposed a variant where we instead want to maximize the number of pegs remaining when no more jumps can be made. Maximizing over all initial locations of a single hole, the maximum number of pegs left on a graph $G$ when no jumps remain is the fool's solitaire number $F(G)$. We determine the fool's solitaire number for the join of any graphs $G$ and $H$. For the cartesian product, we determine $F(G \Box K_k)$ when $k \ge 3$ and $G$ is connected and show why our argument fails when $k=2$. Finally, we give conditions on graphs $G$ and $H$ that imply $F(G \Box H) \ge F(G) F(H)$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。