P. Dankelmann

activity

20082026

most citedBounding the order of a graph using its diameter and metric dimension: a study through tree decompositions and VC dimension

12 citations · 42 across the 21 of their papers we have counts for

collaborators

Showing 2025 · math.COShow all

2 papers · 2 filters

math.CO2025

On Proximity and other Distance Parameters in Planar Graphs

Peter Dankelmann, Sonwabile Mafunda, Sufiyan Mallu

Let $G$ be a connected graph. The average distance of a vertex $v$ of $G$ is the arithmetic mean of the distances from $v$ to all other vertices of $G$ . The proximity and remotenes…

math.CO2025

Proximity and Radius in Outerplanar Graphs with Bounded Faces

Peter Dankelmann, Sonwabile Mafunda, Sufiyan Mallu

Let $G$ be a finite, connected graph and $v$ a vertex of $G$ . The average distance and the eccentricity of $v$ in $G$ are defined as the arithmetic mean and the maximum, respective…