Highest Qualification
Dr. rer. nat.
Field(s) of Research
Graph Theory
Lecturing Experience:
Graph Theory and most subjects in Mathematics
List of Publications:
1. P. Dankelmann, E. Jonck, T. Vetrik, The degree-diameter problem for outerplanar graphs.Discussiones Mathematical Graph Theory (to appear).
2. P. Ali, P. Dankelmann, M.J. Morgan, S. Mukwembi, H.C. Swart, T. Vetrik, The average eccentricity, spanning trees of plane graphs, size and order.
3. Utilitas Mathematica (to appear)
4. P. Dankelmann, New bounds on proximity and remoteness in graphs. Communications in Combinatorics and Optimization, no 1 vol. 1 (2016), 28-40
5. P. Dankelmann, M. Dorfling, Diameter and maximum degree of Eulerian digraphs. Discrete Mathematics 339 no. 4 (2016), 1355-1361.
6. P. Dankelmann, D. Meierling, Maximally edge-connected hypergraphs. Discrete Mathematics 339 no. 1 (2016), 33-38.
7. P. Dankelmann, On the number of resolving pairs in graphs. Graphs and Combinatorics 31 (no. 6) (2015), 2175-2180.
8. S. Bau, P. Dankelmann, Diameter of orientations of graphs with given minimum degree. European Journal of Combinatorics 49 (2015), 126-133.
9. P. Dankelmann, Proximity, remoteness, and minimum degree. Discrete Applied Mathematics 184 (2015), 223-228.
10. P. Dankelmann, Distance and size in digraphs. Discrete Mathematics 338 (no. 1) (2015), 144-148.
11. P. Ali, P. Dankelmann, S. Mukwembi, The Steiner diameter of 3-, 4-, and 5-connected maximal planar graphs. Discrete Applied Mathematics
179 (2014), 222-228.
12. P. Dankelmannn, M.J. Morgan, S. Mukwembi, H.C. Swart, On the eccentric connectivity index and Wiener index of a graph.
Quaestiones Mathematicae 37 no. 1 (2014), 39-47.
13. P. Dankelmann, D. Erwin, W.D. Goddard, S. Mukwembi, H.C. Swart, A Characterisation of Eccentric Sequences of Maximal Outerplanar
Graphs. Australasian Journal of Combinatorics 58 no. 3 (2014), 376-391.
14. P. Dankelmann and S. Mukwembi, Upper bounds on the average eccentricity. Discrete Applied Mathematics 167 (2014), 72-79.
15. P. Dankelmann, T. Vetrik, The degree-diameter problem for claw-free graphs and hypergraphs.
16. Journal of Graph Theory 75 no. 2 (2014), 105-123.
17. P. Dankelmann, W.D. Goddard, C.A. McPillan, H.C. Swart A note on extremal values of the scattering number. Taiwanese Journal of
Mathematics 17 no. 5 (2013), 1651-1658.
18. P. Dankelmann, J.D. Key, B. Rodriges, A characterization of graphs by codes from their incidence matrices. Electronic Journal of
Combinatorics 20 no. 3 (2013), Paper 18.
19. P. Dankelmann, J.D. Key, B. Rodriges, Codes from incidence matrices of graphs. Designs, Codes, and Cryptography 68 no. 1-3 (2013), 373-393.
20. C. Biro, E. Czabarka, P. Dankelmann, L. Szekely, Remarks on the domination number of graphs. Bulletin of the Institute of Combinatorics and
its Applications 64 (2012) 73-82.
21. P. Ali, P. Dankelmann, S. Mukwembi, Upper bounds on the Steiner diameter of a graph. Discrete Applied Mathematics 160 issue 12 (2012), 1845-1850.
22. P. Ali, P. Dankelmann, S. Mukwembi, The radius of k-connected planar graphs with bounded faces. Discrete Mathematics
312 issue 24 (2012), 3636-3642.
Supervision Information:
PhD:
V. Smithdorf, Aspects of distance and domination in graphs
G. Dlamini, Aspects of distances in graphs
S. Mukwembi, Bounds on distances in graphs
P van den Berg, Bounds on distance parameters of graphs
P. Ali, Aspects of distance measures in graphs
Additional information:
I am Editor-in-Chief of the Communications in Combinatorics and Optimization
http://comb-opt.azaruniv.ac.ir/
I am a member of the editorial boards of Utilitas Mathematica
http://bkocay.cs.umanitoba.ca/utilitas/index.html
and the Electronic Journal of Graph Theory and its Applications
http://www.ejgta.org/index.php/ejgta
I am an NRF B-rated researcher.
I am a member of the Academy of Science of South Africa
https://www.assaf.org.za/
I am a Fellow of the University of KwaZulu-Natal
http://www.ukzn.ac.za/
I am a Fellow of the Institute of Combinatorics and Its Applications
http://www.math.uwaterloo.ca/~dstinson/icawebpages/ICAindex.html