Peter Dankelmann
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Peter Dankelmann has a total of 106 co-authors. Here are the top co-authors by number of shared publications:
Henda C. Swart
14 shared publicationsSimon Mukwembi
9 shared publicationsLutz Volkmann
6 shared publications- Ortrud R. Oellermann
University of Winnipeg 515 Portage Avenue R3B 2E9 Winnipeg MB
5 shared publications - Éva Czabarka
Department of Mathematics, University of South Carolina, Columbia, USA
5 shared publications - Bernardo Gabriel Rodrigues
Department of Mathematics and Applied Mathematics, University of Pretoria, Hatfield, Pretoria, South Africa
4 shared publications
Latest Publications
- Open Access
- 9 July 2026
- Published by Elsevier in SSRN Electronic Journal
On the oriented diameter of 2-trees
Let $G$ be a finite connected undirected graph and $ \vec{G}$ be a strong orientation of $G$. The diameter of $\vec{G} $, denoted by $\text{diam}(\vec{G})$, is the maximum distance between any two vertices of $\vec{G}$. The oriented diameter of $G$ is defined as the minimum diameter over all strong orientations of $G$. In this paper, we establish an upper bound $\lceil\frac{n}{2}\rceil $ on the oriented diameter of an $n$-vertex 2-tree (except for five small exceptions). Furthermore, we show that this upper bound is tight. This extends a result for maximal outerplanar graphs [Wang et al., J. Graph Theory 98 no.\ 3, 2021] to all 2-trees.- 9 July 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessOn the oriented diameter of 2-trees
Let $G$ be a finite connected undirected graph and $ \vec{G}$ be a strong orientation of $G$. The diameter of $\vec{G} $, denoted by $\text{diam}(\vec{G})$, is the maximum distance between any two vertices of $\vec{G}$. The oriented diameter of $G$ is defined as the minimum diameter over all strong orientations of $G$. In this paper, we establish an upper bound $\lceil\frac{n}{2}\rceil $ on the oriented diameter of an $n$-vertex 2-tree (except for five small exceptions). Furthermore, we show that this upper bound is tight. This extends a result for maximal outerplanar graphs [Wang et al., J. Graph Theory 98 no.\ 3, 2021] to all 2-trees. - Open Access
- 4 June 2026
- Published by Elsevier in Discrete Mathematics
- Vol. 349 (11)
Proximity and radius in outerplanar graphs with bounded faces
- 4 June 2026
- Published by Elsevier in Discrete Mathematics
- Vol. 349 (11)
Open AccessProximity and radius in outerplanar graphs with bounded faces
- Open Access
- 30 January 2026
- Published by University Library in Kragujevac in Match Communications in Mathematical and in Computer Chemistry
- Vol. 2 (96) , 731
Distance Sequences to Bound the Harary Index and Other Wiener-Type Indices of a Graph
In this paper we obtain several new bounds on well-studied topological indices, among those sharp lower bounds on the Harary index and sharp upper bounds on the hyper-Wiener index and the multiplicative Wiener index for (i) graphs of given order and size (which solves a problem in the monograph [Xu, Das, Trinajsti´c, The Harary index of a graph, Springer (2015)]), (ii) κ-connected graphs, where κ is even, (iii) maximal outerplanar graphs, (iv) Apollonian networks, and (v) for trees in which all vertices have odd degree. We use a novel approach to prove our bounds for a very general class of distance-based topological indices of graphs, which includes the Wiener index and most of its generalizations, including the Harary index, the hyper-Wiener index and the multiplicative Wiener index.
- 30 January 2026
- Published by University Library in Kragujevac in Match Communications in Mathematical and in Computer Chemistry
- Vol. 2 (96) , 731
Open AccessDistance Sequences to Bound the Harary Index and Other Wiener-Type Indices of a Graph
In this paper we obtain several new bounds on well-studied topological indices, among those sharp lower bounds on the Harary index and sharp upper bounds on the hyper-Wiener index and the multiplicative Wiener index for (i) graphs of given order and size (which solves a problem in the monograph [Xu, Das, Trinajsti´c, The Harary index of a graph, Springer (2015)]), (ii) κ-connected graphs, where κ is even, (iii) maximal outerplanar graphs, (iv) Apollonian networks, and (v) for trees in which all vertices have odd degree. We use a novel approach to prove our bounds for a very general class of distance-based topological indices of graphs, which includes the Wiener index and most of its generalizations, including the Harary index, the hyper-Wiener index and the multiplicative Wiener index.
- Open Access
- 26 February 2025
- Published by Elsevier in Discrete Mathematics
- Vol. 348 (7)
Remoteness of graphs with given size and connectivity constraints
- 26 February 2025
- Published by Elsevier in Discrete Mathematics
- Vol. 348 (7)
Open AccessRemoteness of graphs with given size and connectivity constraints
- Open Access
- 18 February 2025
- Published by Elsevier in Discrete Mathematics
- Vol. 348 (6)
The oriented diameter of graphs derived from other graphs
- 18 February 2025
- Published by Elsevier in Discrete Mathematics
- Vol. 348 (6)
Open AccessThe oriented diameter of graphs derived from other graphs
- Open Access
- 31 January 2025
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 366, 250-256
On the edge-connectivity of the square of a graph
- 31 January 2025
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 366, 250-256
Open AccessOn the edge-connectivity of the square of a graph
- Open Access
- 28 January 2024
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 40 (1) , 1-21
The Oriented Diameter of Graphs with Given Connected Domination Number and Distance Domination Number
Let G be a bridgeless graph. An orientation of G is a digraph obtained from G by assigning a direction to each edge. The oriented diameter of G is the minimum diameter among all strong orientations of G. The connected domination number $$\gamma _c(G)$$ of G is the minimum cardinality of a set S of vertices of G such that every vertex of G is in S or adjacent to some vertex of S, and which induces a connected subgraph in G. We prove that the oriented diameter of a bridgeless graph G is at most $$2 \gamma _c(G) +3$$ if $$\gamma _c(G)$$ is even and $$2 \gamma _c(G) +2$$ if $$\gamma _c(G)$$ is odd. This bound is sharp. For $$d \in {\mathbb {N}}$$ , the d-distance domination number $$\gamma ^d(G)$$ of G is the minimum cardinality of a set S of vertices of G such that every vertex of G is at distance at most d from some vertex of S. As an application of a generalisation of the above result on the connected domination number, we prove an upper bound on the oriented diameter of the form $$(2d+1)(d+1)\gamma ^d(G)+ O(d)$$ . Furthermore, we construct bridgeless graphs whose oriented diameter is at least $$(d+1)^2 \gamma ^d(G) +O(d)$$ , thus demonstrating that our above bound is best possible apart from a factor of about 2.- 28 January 2024
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 40 (1) , 1-21
Open AccessThe Oriented Diameter of Graphs with Given Connected Domination Number and Distance Domination Number
Let G be a bridgeless graph. An orientation of G is a digraph obtained from G by assigning a direction to each edge. The oriented diameter of G is the minimum diameter among all strong orientations of G. The connected domination number $$\gamma _c(G)$$ of G is the minimum cardinality of a set S of vertices of G such that every vertex of G is in S or adjacent to some vertex of S, and which induces a connected subgraph in G. We prove that the oriented diameter of a bridgeless graph G is at most $$2 \gamma _c(G) +3$$ if $$\gamma _c(G)$$ is even and $$2 \gamma _c(G) +2$$ if $$\gamma _c(G)$$ is odd. This bound is sharp. For $$d \in {\mathbb {N}}$$ , the d-distance domination number $$\gamma ^d(G)$$ of G is the minimum cardinality of a set S of vertices of G such that every vertex of G is at distance at most d from some vertex of S. As an application of a generalisation of the above result on the connected domination number, we prove an upper bound on the oriented diameter of the form $$(2d+1)(d+1)\gamma ^d(G)+ O(d)$$ . Furthermore, we construct bridgeless graphs whose oriented diameter is at least $$(d+1)^2 \gamma ^d(G) +O(d)$$ , thus demonstrating that our above bound is best possible apart from a factor of about 2. - 5 September 2023
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (1)
Edge-fault diameter of C4-free graphs
- 5 September 2023
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (1)
Edge-fault diameter of C4-free graphs
- 25 April 2023
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 336, 125-131
On the Wiener index of orientations of graphs
- 25 April 2023
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 336, 125-131
On the Wiener index of orientations of graphs
- 20 January 2023
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 330, 98-111
On Wiener index and average eccentricity of graphs of girth at least 6 and -free graphs- 20 January 2023
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 330, 98-111
On Wiener index and average eccentricity of graphs of girth at least 6 and -free graphs