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

迭代跳跃图

Iterated Jump Graphs

Fran Herr, Legrand Jones

摘要:

单图$G$的跳图$J(G)$具有表示$G$中的边的顶点,其中$J(G)$中的两个顶点相邻当且仅当$G$中的对应边不共享端点。在本文中,我们研究了序列的图形迭代的跳转图操作,并描述了这个序列的所有初始图的行为。我们建立在Chartrand等人的工作基础上,他们证明了少数跳跃图序列终止,两个序列收敛。我们扩展这些结果表明,有没有非平凡的重复序列的跳跃图。所有发散的跳图序列在积累一定的子图时都是无限增长的。

英文摘要:

The jump graph $J(G)$ of a simple graph $G$ has vertices which represent edges in $G$ where two vertices in $J(G)$ are adjacent if and only if the corresponding edges in $G$ do not share an endpoint. In this paper, we examine sequences of graphs generated by iterating the jump graph operation and characterize the behavior of this sequence for all initial graphs. We build on work by Chartrand et al. who showed that a handful of jump graph sequences terminate and two sequences converge. We extend these results by showing that there are no non-trivial repeating sequences of jump graphs. All diverging jump graph sequences grow without bound while accumulating certain subgraphs.

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

↑