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 2021Show all

2 papers · 1 filter

math.CO2021★ 1 cited

On the difference between proximity and other distance parameters in triangle-free graphs and $C_{4}$ -free graphs

Peter Dankelmann, Sonwabile Mafunda

The average distance of a vertex $v$ of a connected graph $G$ is the arithmetic mean of the distances from $v$ to all other vertices of $G$ . The proximity $π (G)$ and the remoteness…

math.CO2021

Proof of a Conjecture on the Wiener Index of Eulerian Graphs

Peter Dankelmann

The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices. A connected graph is Eulerian if its vertex degrees are all even. In [Gut…

On the difference between proximity and other distance parameters in triangle-free graphs and C4​-free graphs

Proof of a Conjecture on the Wiener Index of Eulerian Graphs

On the difference between proximity and other distance parameters in triangle-free graphs and $C_{4}$ -free graphs