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

最短路径重构图

Reconfiguration graphs of shortest paths

John Asplund, Kossi Edoh, Ruth Haas, Yulia Hristova, Beth Novick, Brett Werner

摘要:

对于图$G$和$a,b\in V(G)$,$G$相对于$a$和$b$的最短路径重构图由$S(G,a,b)$表示。$S(G,a,b)$的顶点集是$G$中$a$和$b$之间所有最短路径的集合。$V(S(G,a,b))$中的两个顶点相邻,如果它们在$G$中的对应路径相差正好一个顶点。本文研究了最短路图的性质。结果包括建立类的图,出现最短路径图,分解和总和涉及最短路径图,和周长$5$或更大的最短路径图的完整分类。我们还证明了格图的最短路图是格的诱导子图。

英文摘要:

For a graph $G$ and $a,b\in V(G)$, the shortest path reconfiguration graph of $G$ with respect to $a$ and $b$ is denoted by $S(G,a,b)$. The vertex set of $S(G,a,b)$ is the set of all shortest paths between $a$ and $b$ in $G$. Two vertices in $V(S(G,a,b))$ are adjacent, if their corresponding paths in $G$ differ by exactly one vertex. This paper examines the properties of shortest path graphs. Results include establishing classes of graphs that appear as shortest path graphs, decompositions and sums involving shortest path graphs, and the complete classification of shortest path graphs with girth $5$ or greater. We also show that the shortest path graph of a grid graph is an induced subgraph of a lattice.

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

↑