arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2308.08970math.COcs.DM
收藏

测地图:实验与新构造

Geodetic Graphs: Experiments and New Constructions

Florian Stober, Armin Weiß

AI总结:

本文提出枚举程序,找出顶点数≤25的全部测地图及≤32的正则测地图,并发现两个新的测地图无限族。

摘要:

1962年,Ore开创了测地图的研究。若图中任意两个顶点之间的最短路径是唯一的,则该图称为测地图。在随后的几年中,大量论文涌现,探讨其独特性质。然而,对测地图的完整分类仍遥不可及。在本工作中,我们提出一个枚举给定大小所有测地图的程序。利用该程序,我们成功找到了所有顶点数不超过25的测地图,以及所有顶点数不超过32的正则测地图。这导致发现了两个新的测地图无限族。

英文摘要:

In 1962 Ore initiated the study of geodetic graphs. A graph is called geodetic if the shortest path between every pair of vertices is unique. In the subsequent years a wide range of papers appeared investigating their peculiar properties. Yet, a complete classification of geodetic graphs is out of reach. In this work we present a program enumerating all geodetic graphs of a given size. Using our program, we succeed to find all geodetic graphs with up to 25 vertices and all regular geodetic graphs with up to 32 vertices. This leads to the discovery of two new infinite families of geodetic graphs.

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

↑