M. Kramer

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2021

Maximally distance-unbalanced trees

Marie Kramer, Dieter Rautenbach

For a graph $G$ , and two distinct vertices $u$ and $v$ of $G$ , let $n_{G} (u, v)$ be the number of vertices of $G$ that are closer in $G$ to $u$ than to $v$ . Miklavič and Šparl (arXiv:…

math.CO2020

Minimum distance-unbalancedness of trees

Marie Kramer, Dieter Rautenbach

For a graph $G$ , and two distinct vertices $u$ and $v$ of $G$ , let $n_{G} (u, v)$ be the number of vertices of $G$ that are closer in $G$ to $u$ than to $v$ . Miklavič and Šparl (arXiv:…