12 citations · 42 across the 21 of their papers we have counts for
Showing 2022 · math.COShow all
3 papers · 2 filters
math.CO2022
Diameter of orientations of graphs with given order and number of blocks
P. Dankelmann, M. J. Morgan, E. J. Rivett-Carnac
A strong orientation of a graph is an assignment of a direction to each edge such that is strongly connected. The oriented diameter of is the smallest diameter among al…
math.CO2022
On the Wiener Index of Orientations of Graphs
Peter Dankelmann
The Wiener index of a strong digraph is defined as the sum of the distances between all ordered pairs of vertices. This definition has been extended to digraphs that are not ne…
math.CO2022★ 2 cited
Proximity, remoteness and maximum degree in graphs
Peter Dankelmann, Sonwabile Mafunda, Sufiyan Mallu
The average distance of a vertex of a connected graph is the arithmetic mean of the distances from to all other vertices of . The proximity and the remoteness…