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

3 papers · 1 filter

math.CO2019★ 2 cited

Average eccentricity, minimum degree and maximum degree in graphs

P. Dankelmann, F. J. Osaye

Let $G$ be a connected finite graph with vertex set $V (G)$ . The eccentricity $e (v)$ of a vertex $v$ is the distance from $v$ to a vertex farthest from $v$ . The average eccentricity…

math.CO2019

The maximum average connectivity among all orientations of a graph

Rocio M. Casablanca, Peter Dankelmann, Wayne Goddard +2

For distinct vertices $u$ and $v$ in a graph $G$ , the {\em connectivity} between $u$ and $v$ , denoted $κ_{G} (u, v)$ , is the maximum number of internally disjoint $u$ -- $v$ paths in $G$ …

math.CO2019★ 7 cited

Wiener Index and Remoteness in Triangulations and Quadrangulations

Éva Czabarka, Peter Dankelmann, Trevor Olsen +1

Let $G$ be a a connected graph. The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices. We provide asymptotic formulae for the ma…