Peter Dankelmann

ORCID

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 32

Top Venues

Discret. Appl. Math.

Discret. Math.

J. Graph Theory

Discret. Math. Theor. Comput. Sci.

Publications

Alex Alochukwu, Peter Dankelmann
-free graphs. Discret. Math. 347 (1) (2024)
Peter Dankelmann, Jane Morgan, Emily Rivett-Carnac
The Oriented Diameter of Graphs with Given Connected Domination Number and Distance Domination Number. Graphs Comb. 40 (1) (2024)
Peter Dankelmann, Matthew DeVilbiss, David J. Erwin, Kelly Guest, Ryan Matzke
On subgraphs with prescribed eccentricities. Discuss. Math. Graph Theory 43 (3) (2023)
Peter Dankelmann, Jane Morgan, Emily Rivett-Carnac
Metric dimension and diameter in bipartite graphs. Discuss. Math. Graph Theory 43 (2) (2023)
Alex Alochukwu, Peter Dankelmann
On Wiener index and average eccentricity of graphs of girth at least 6 and (C4,C5)-free graphs. Discret. Appl. Math. 330 (2023)
Peter Dankelmann
On the Wiener index of orientations of graphs. Discret. Appl. Math. 336 (2023)
Rocío M. Casablanca, Peter Dankelmann, Wayne Goddard, Lucas Mol, Ortrud Oellermann
The maximum average connectivity among all orientations of a graph. J. Comb. Optim. 43 (3) (2022)
Éva Czabarka, Peter Dankelmann, Trevor Olsen, László A. Székely
Proximity in triangulations and quadrangulations. Electron. J. Graph Theory Appl. 10 (2) (2022)
Peter Dankelmann, Sonwabile Mafunda
On the difference between proximity and other distance parameters in triangle-free graphs and C4-free graphs. Discret. Appl. Math. 321 (2022)
Peter Dankelmann, Sonwabile Mafunda, Sufiyan Mallu
Proximity, remoteness and maximum degree in graphs. Discret. Math. Theor. Comput. Sci. 24 (2) (2022)
Garner Cochran, Éva Czabarka, Peter Dankelmann, László A. Székely
A Size Condition for Diameter Two Orientable Graphs. Graphs Comb. 37 (2) (2021)
Yaping Mao, Peter Dankelmann, Zhao Wang
Steiner diameter, maximum degree and size of a graph. Discret. Math. 344 (8) (2021)
Peter Dankelmann
Proof of a conjecture on the Wiener index of Eulerian graphs. Discret. Appl. Math. 301 (2021)
Peter Dankelmann, Elizabeth Jonck, Sonwabile Mafunda
-free graphs in terms of order and minimum degree. Discret. Math. 344 (9) (2021)
Xiaolin Wang, Yaojun Chen, Peter Dankelmann, Yubao Guo, Michel Surmacs, Lutz Volkmann
Oriented diameter of maximal outerplanar graphs. J. Graph Theory 98 (3) (2021)
Éva Czabarka, Peter Dankelmann, Trevor Olsen, László A. Székely
Wiener Index and Remoteness in Triangulations and Quadrangulations. Discret. Math. Theor. Comput. Sci. 23 (1) (2021)
Peter Dankelmann, Alex Alochukwu
Wiener index in graphs with given minimum degree and maximum degree. Discret. Math. Theor. Comput. Sci. 23 (1) (2021)
Alex Alochukwu, Peter Dankelmann
Distances in graphs of girth 6 and generalised cages. Discret. Appl. Math. 294 (2021)
Peter Dankelmann, Fadekemi Janet Osaye
Average eccentricity, minimum degree and maximum degree in graphs. J. Comb. Optim. 40 (3) (2020)
Peter Dankelmann, David J. Erwin
Distance domination and generalized eccentricity in graphs with given minimum degree. J. Graph Theory 94 (1) (2020)
Rocío M. Casablanca, Peter Dankelmann
Distance and Eccentric sequences to bound the Wiener index, Hosoya polynomial and the average eccentricity in the strong products of graphs. Discret. Appl. Math. 263 (2019)
Peter Dankelmann
On average distance in tournaments and Eulerian digraphs. Discret. Appl. Math. 266 (2019)
Peter Dankelmann
The Steiner k-Wiener index of graphs with given minimum degree. Discret. Appl. Math. 268 (2019)
Peter Dankelmann, Fadekemi Janet Osaye
Average eccentricity, k-packing and k-domination in graphs. Discret. Math. 342 (5) (2019)
Peter Dankelmann, Fadekemi Janet Osaye, Simon Mukwembi, Bernardo Gabriel Rodrigues
Upper bounds on the average eccentricity of K3-free and C4-free graphs. Discret. Appl. Math. 270 (2019)
Éva Czabarka, Peter Dankelmann, László A. Székely
A degree condition for diameter two orientability of graphs. Discret. Math. 342 (4) (2019)
Laurent Beaudou, Peter Dankelmann, Florent Foucaud, Michael A. Henning, Arnaud Mary, Aline Parreau
Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension. SIAM J. Discret. Math. 32 (2) (2018)
Peter Dankelmann, Yubao Guo, Michel Surmacs
Oriented diameter of graphs with given maximum degree. J. Graph Theory 88 (1) (2018)
Peter Dankelmann
Bounds on the fault-diameter of graphs. Networks 70 (2) (2017)
Peter Dankelmann, Elizabeth Jonck, Tomás Vetrík
The degree-diameter problem for outerplanar graphs. Discuss. Math. Graph Theory 37 (3) (2017)
Peter Dankelmann, Dirk Meierling
Maximally edge-connected hypergraphs. Discret. Math. 339 (1) (2016)
Peter Dankelmann, Michael Dorfling
Diameter and maximum degree in Eulerian digraphs. Discret. Math. 339 (4) (2016)
Peter Dankelmann
On the Number of Resolving Pairs in Graphs. Graphs Comb. 31 (6) (2015)
Peter Dankelmann
Proximity, remoteness and minimum degree. Discret. Appl. Math. 184 (2015)
Peter Dankelmann
Distance and size in digraphs. Discret. Math. 338 (1) (2015)
Sheng Bau, Peter Dankelmann
Diameter of orientations of graphs with given minimum degree. Eur. J. Comb. 49 (2015)
Peter Dankelmann, David Erwin, Wayne Goddard, Simon Mukwembi, Henda C. Swart
A characterisation of eccentric sequences of maximal outerplanar graphs. Australas. J Comb. 58 (2014)
Peter Dankelmann, Simon Mukwembi
Upper bounds on the average eccentricity. Discret. Appl. Math. 167 (2014)
Peter Dankelmann, Tomás Vetrík
The Degree-Diameter Problem for Claw-Free Graphs and Hypergraphs. J. Graph Theory 75 (2) (2014)
Patrick Ali, Simon Mukwembi, Peter Dankelmann
Steiner diameter of 3, 4 and 5-connected maximal planar graphs. Discret. Appl. Math. 179 (2014)
Peter Dankelmann, Jennifer D. Key, Bernardo Gabriel Rodrigues
A Characterization of Graphs by Codes from their Incidence Matrices. Electron. J. Comb. 20 (3) (2013)
Peter Dankelmann, Jennifer D. Key, Bernardo Gabriel Rodrigues
Codes from incidence matrices of graphs. Des. Codes Cryptogr. 68 (1-3) (2013)
Peter Dankelmann, David Erwin, Wayne Goddard, Simon Mukwembi, Henda C. Swart
Eccentric counts, connectivity and chordality. Inf. Process. Lett. 112 (24) (2012)
Peter Dankelmann, David Erwin, Simon Mukwembi, Bernardo Gabriel Rodrigues, Eric C. Mwambene, Gert Sabidussi
Automorphism group and diameter of a graph. J. Graph Theory 70 (1) (2012)
Peter Dankelmann
Average distance in weighted graphs. Discret. Math. 312 (1) (2012)
Patrick Ali, Peter Dankelmann, Simon Mukwembi
Upper bounds on the Steiner diameter of a graph. Discret. Appl. Math. 160 (12) (2012)
Patrick Ali, Peter Dankelmann, Simon Mukwembi
The radius of k-connected planar graphs with bounded faces. Discret. Math. 312 (24) (2012)
Frank Bullock, Peter Dankelmann, Marietjie Frick, Michael A. Henning, Ortrud R. Oellermann, Susan A. van Aardt
-Traceable Graphs. Electron. J. Comb. 18 (1) (2011)
Peter Dankelmann, Henda C. Swart, Paul van den Berg
The number of edges in a bipartite graph of given radius. Discret. Math. 311 (8-9) (2011)
Aleksandar Ilic, Dragan Stevanovic, Lihua Feng, Guihai Yu, Peter Dankelmann
Degree distance of unicyclic and bicyclic graphs. Discret. Appl. Math. 159 (8) (2011)
Peter Dankelmann
On the distance distribution of trees. Discret. Appl. Math. 159 (10) (2011)
Peter Dankelmann
Average distance and generalised packing in graphs. Discret. Math. 310 (17-18) (2010)
Peter Dankelmann, Lutz Volkmann
The Diameter of Almost Eulerian Digraphs. Electron. J. Comb. 17 (1) (2010)
Peter Dankelmann, Simon Mukwembi, Henda C. Swart
Average distance and vertex-connectivity. J. Graph Theory 62 (2) (2009)
Peter Dankelmann, Ivan Gutman, Simon Mukwembi, Henda C. Swart
The edge-Wiener index of a graph. Discret. Math. 309 (10) (2009)
Peter Dankelmann, Ivan Gutman, Simon Mukwembi, Henda C. Swart
On the degree distance of a graph. Discret. Appl. Math. 157 (13) (2009)
Peter Dankelmann, Gregory Z. Gutin, Eun Jung Kim
On complexity of Minimum Leaf Out-Branching problem. Discret. Appl. Math. 157 (13) (2009)
Peter Dankelmann, Lutz Volkmann
Minimum size of a graph or digraph of given radius. Inf. Process. Lett. 109 (16) (2009)
Éva Czabarka, Peter Dankelmann, László A. Székely
Diameter of 4-colourable graphs. Eur. J. Comb. 30 (5) (2009)
Peter Dankelmann, David P. Day, David Erwin, Simon Mukwembi, Henda C. Swart
Domination with exponential decay. Discret. Math. 309 (19) (2009)
Peter Dankelmann, Angelika Hellwig, Lutz Volkmann
Inverse degree and edge-connectivity. Discret. Math. 309 (9) (2009)
Peter Dankelmann, Simon Mukwembi, Henda C. Swart
Average Distance and Edge-Connectivity I. SIAM J. Discret. Math. 22 (1) (2008)
Peter Dankelmann, Gregory Z. Gutin, Eun Jung Kim
On Complexity of Minimum Leaf Out-branching Problem CoRR (2008)
Peter Dankelmann, Simon Mukwembi, Henda C. Swart
Average Distance and Edge-Connectivity II. SIAM J. Discret. Math. 21 (4) (2008)
Peter Dankelmann, Henda C. Swart, Paul van den Berg
Diameter and inverse degree. Discret. Math. 308 (5-6) (2008)
Peter Dankelmann, Gert Sabidussi
Embedding graphs as isometric medians. Discret. Appl. Math. 156 (12) (2008)
Peter Dankelmann, Lutz Volkmann
Average distance in bipartite tournaments. Ars Comb. 83 (2007)
Peter Dankelmann, Angelika Hellwig, Lutz Volkmann
On the connectivity of diamond-free graphs. Discret. Appl. Math. 155 (16) (2007)
Peter Dankelmann, David P. Day, Johannes H. Hattingh, Michael A. Henning, Lisa R. Markus, Henda C. Swart
On equality in an upper bound for the restrained and total domination numbers of a graph. Discret. Math. 307 (22) (2007)
Peter Dankelmann, Michael A. Henning, Wayne Goddard, Renu C. Laskar
Simultaneous graph parameters: Factor domination and factor total domination. Discret. Math. 306 (18) (2006)
Peter Dankelmann, Johannes H. Hattingh, Michael A. Henning, Henda C. Swart
Trees with Equal Domination and Restrained Domination Numbers. J. Glob. Optim. 34 (4) (2006)
Peter Dankelmann, Ortrud R. Oellermann
Degree Sequences of Optimally Edge-Connected Multigraphs. Ars Comb. 77 (2005)
Peter Dankelmann
The diameter of directed graphs. J. Comb. Theory, Ser. B 94 (1) (2005)
Peter Dankelmann, Lutz Volkmann
Average distance in k-connected tournaments. Ars Comb. 77 (2005)
Peter Dankelmann, Gayla S. Domke, Wayne Goddard, Paul J. P. Grobler, Johannes H. Hattingh, Henda C. Swart
Maximum sizes of graphs with given domination parameters. Discret. Math. 281 (1-3) (2004)
Peter Dankelmann, Neil J. Calkin
The Domatic Number of Regular Graphs. Ars Comb. 73 (2004)
Elias Dahlhaus, Peter Dankelmann, R. Ravi
A linear-time algorithm to compute a MAD tree of an interval graph. Inf. Process. Lett. 89 (5) (2004)
Peter Dankelmann, Ortrud Oellermann, Jian-Liang Wu
Minimum average distance of strong orientations of graphs. Discret. Appl. Math. 143 (1-3) (2004)
Peter Dankelmann, Ortrud Oellermann
Bounds on the average connectivity of a graph. Discret. Appl. Math. 129 (2-3) (2003)
Peter Dankelmann, Henda C. Swart, David P. Day
On strong distances in oriented graphs. Discret. Math. 266 (1-3) (2003)
Gary Chartrand, Peter Dankelmann, Michelle Schultz, Henda C. Swart
Twin Domination in Digraphs. Ars Comb. 67 (2003)
Peter Dankelmann, Renu C. Laskar
Factor domination and minimum degree. Discret. Math. 262 (1-3) (2003)
Elias Dahlhaus, Peter Dankelmann, Wayne Goddard, Henda C. Swart
MAD trees and distance-hereditary graphs. Discret. Appl. Math. 131 (1) (2003)
Sheng Bau, Michael A. Henning, Peter Dankelmann
Average lower independence in trees and outerplanar graphs. Ars Comb. 69 (2003)
Peter Dankelmann, Wayne Goddard, Ortrud Oellermann, Henda C. Swart
Augmenting trees so that every three vertices lie on a cycle. Discret. Appl. Math. 116 (1-2) (2002)
Peter Dankelmann, Dieter Rautenbach, Lutz Volkmann
Weighted domination in triangle-free graphs. Discret. Math. 250 (1-3) (2002)
Peter Dankelmann, Wayne Goddard, Peter J. Slater
Average distance in colored graphs. J. Graph Theory 38 (1) (2001)
Peter Dankelmann, Dieter Rautenbach, Lutz Volkmann
Some results on graph parameters in weighted graphs. Electron. Notes Discret. Math. 5 (2000)
Peter Dankelmann, Roger C. Entringer
Average distance, minimum degree, and spanning trees. J. Graph Theory 33 (1) (2000)
Peter Dankelmann, Lutz Volkmann
Degree sequence conditions for maximally edge-connected graphs depending on the clique number. Discret. Math. 211 (2000)
Peter Dankelmann, Wayne Goddard, Michael A. Henning, Henda C. Swart
Generalized eccentricity, radius, and diameter in graphs. Networks 34 (4) (1999)
Peter Dankelmann, Vivienne Smithdorf, Henda C. Swart
Radius-forcing sets in graphs. Australas. J Comb. 17 (1998)
Peter Dankelmann, Henda C. Swart, Ortrud Oellermann
On the Average Steiner Distance of Graphs with Prescribed Properties. Discret. Appl. Math. 79 (1-3) (1997)
Peter Dankelmann, Lutz Volkmann
Degree sequence conditions for maximally edge-connected graphs and digraphs. J. Graph Theory 26 (1) (1997)
Peter Dankelmann
Average Distance and Domination Number. Discret. Appl. Math. 80 (1) (1997)
Peter Dankelmann, Ortrud R. Oellermann, Henda C. Swart
The average Steiner distance of a graph. J. Graph Theory 22 (1) (1996)
Peter Dankelmann, Lutz Volkmann
New sufficient conditions for equality of minimum degree and edge-connectivity. Ars Comb. 40 (1995)
Peter Dankelmann, Thomas Niessen, Ingo Schiermeyer
On Path-Tough Graphs. SIAM J. Discret. Math. 7 (4) (1994)
Peter Dankelmann
Average Distance and Independence Number. Discret. Appl. Math. 51 (1-2) (1994)
Peter Dankelmann
Computing the Average Distance of an Interval Graph. Inf. Process. Lett. 48 (6) (1993)

Peter Dankelmann.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Peter Dankelmann