arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2609.30035math.COcs.DMmath.MG

光滑弱模图

Smooth weakly modular graphs

  • Aix-Marseille Université, CNRS, and Université de Toulon(艾克斯-马赛大学、法国国家科学研究中心和土伦大学)
  • Institut Universitaire de France (IUF)(法国高等研究院)
  • Max Planck Institute for Mathematics in the Sciences(马普科学数学研究所)
  • Leipzig University(莱比锡大学)
  • University of Vienna(维也纳大学)
  • Universidad National de Colombia(哥伦比亚国立大学)
  • Santa Fe Institute(圣塔菲研究所)

机构由 AI 辅助整理,请以论文原文为准。

Victor Chepoi, Bruno J. Schmidt, Peter F. Stadler

AI总结:

本文刻画了光滑与强光滑弱模图,通过5和7顶点的禁止等距子图解决了Brešar等人的问题1,并进一步刻画了素强光滑弱模图。

AI中文摘要:

图 $G=(V,E)$ 被称为光滑的(分别地,强光滑的),如果对于任意两个顶点 $u,v\in V$,距离点阴影 $v|u:= \{ x\in V: d(u,x)=d(u,v)+d(v,x)\}$(分别地,点阴影 $v/u:= \{ x\in V: v\in\mathrm{conv}(u,x)\}$)是测地凸的。光滑图由 Nebeský(2005)在步进系统的背景下引入。具有凸点阴影和凸距离点阴影的图也自然地出现在凸性理论中。Brešar 等人(2026)最近表明,几类图是光滑的,并且光滑性在笛卡尔积、门控合并和等距子图下得以保持。弱模图包含度量图论中最重要的图类:中位图、模图、Helly 图、桥接图和双极图。在本文中,我们基于 5 个和 7 个顶点上的禁止等距子图来刻画光滑和强光滑的弱模图。这解决了 Brešar 等人论文中的问题 1。我们还刻画了素强光滑弱模图,即不能通过笛卡尔积和门控合并从更小的图获得的强光滑弱模图。

英文摘要:

A graph $G=(V,E)$ is called smooth (respectively, strongly smooth) if for any two vertices $u,v\in V$, the distance point-shadow $v|u := \{ x\in V: d(u,x)=d(u,v)+d(v,x)\}$, respectively, the point-shadow $v/u := \{ x\in V: v\in\mathrm{conv}(u,x)\}$, is geodesically convex. Smooth graphs have been introduced by Nebeský (2005) in the context of step systems. Graphs with convex point-shadows and convex distance point-shadows also naturally occur in convexity theory. Brešar et al. (2026) recently showed that several classes of graphs are smooth and that smoothness is preserved by Cartesian products, gated amalgams, and isometric subgraphs. Weakly modular graphs comprise the most important classes of graphs from Metric Graph Theory: median, modular, Helly, bridged, and dual polar graphs. In this note, we characterize smooth and strongly smooth weakly modular graphs in terms of forbidden isometric subgraphs on 5 and 7 vertices. This settles Problem 1 of the paper by Brešar et al. We also characterize prime strongly smooth weakly modular graphs, i.e., strongly smooth weakly modular graphs that cannot be obtained from smaller graphs by Cartesian products and gated amalgams.

↑