Bruno J. Schmidt

activity

20242026

collaborators

Showing 2026Show all

2 papers · 1 filter

math.CO2026

Smooth weakly modular graphs

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

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)}$ , respect…

math.CO2026

Smooth Graphs

Boštjan Brešar, Manoj Changat, Prasanth G. Narasimha-Shenoi +2

The notion of smoothness was introduced originally in the context of step systems on connected graphs. Smoothness turns out to be a very general property of metrics defined by a fi…