12 citations · 42 across the 21 of their papers we have counts for
6 papers · 2 filters
Wiener index in graphs with given minimum degree and maximum degree
Peter Dankelmann, Alex Alochukwu
Let be a connected graph of order .The Wiener index of is the sum of the distances between all unordered pairs of vertices of . In this paper we show that the…
Bounding the -Steiner Wiener and Wiener-type indices of trees in terms of eccentric sequence
Peter Dankelmann, Audace A. V. Dossou-Olory
The eccentric sequence of a connected graph is the nondecreasing sequence of the eccentricities of its vertices. The Wiener index of is the sum of the distances between all…
Upper Bounds on the average eccentricity of Graphs of Girth and , -free Graphs
Alex Alochukwu, Peter Dankelmann
Let be a finite, connected graph. The eccentricity of a vertex of is the distance from to a vertex farthest from . The average eccentricity of is the arithme…
Wiener index, number of subtrees, and tree eccentric sequence
Peter Dankelmann, Audace A. V. Dossou-Olory
The eccentricity of a vertex in a connected graph is the distance between and a vertex farthest from it; the eccentric sequence of is the nondecreasing sequence of…
Proximity and remoteness in triangle-free and C_4-free graphs in terms of order and minimum degree
Peter Dankelmann, Elizabeth Jonck, Sonwabile Mafunda
Let be a finite, connected graph. The average distance of a vertex of is the arithmetic mean of the distances from to all other vertices of . The remoteness $ρ(G…
Proximity in Triangulations and Quadrangulations
Éva Czabarka, Peter Dankelmann, Trevor Olsen +1
Let be a connected graph. If denotes the arithmetic mean of the distances from to all other vertices of , then the proximity, , of is defined as t…