Computing the Average Distance of an Interval Graph. - Peter Dankelmann (Inf. Process. Lett., 1993)

Average Distance and Independence Number. - Peter Dankelmann (Discret. Appl. Math., 1994)

On Path-Tough Graphs. - Peter Dankelmann; Thomas Niessen; Ingo Schiermeyer (SIAM J. Discret. Math., 1994)

New sufficient conditions for equality of minimum degree and edge-connectivity. - Peter Dankelmann; Lutz Volkmann (Ars Comb., 1995)

The average Steiner distance of a graph. - Peter Dankelmann; Ortrud R. Oellermann; Henda C. Swart (J. Graph Theory, 1996)

Average Distance and Domination Number. - Peter Dankelmann (Discret. Appl. Math., 1997)

On the Average Steiner Distance of Graphs with Prescribed Properties. - Peter Dankelmann; Henda C. Swart; Ortrud Oellermann (Discret. Appl. Math., 1997)

Degree sequence conditions for maximally edge-connected graphs and digraphs. - Peter Dankelmann; Lutz Volkmann (J. Graph Theory, 1997)

Radius-forcing sets in graphs. - Peter Dankelmann; Vivienne Smithdorf; Henda C. Swart (Australas. J Comb., 1998)

Generalized eccentricity, radius, and diameter in graphs. - Peter Dankelmann; Wayne Goddard; Michael A. Henning; Henda C. Swart (Networks, 1999)

Degree sequence conditions for maximally edge-connected graphs depending on the clique number. - Peter Dankelmann; Lutz Volkmann (Discret. Math., 2000)

Some results on graph parameters in weighted graphs. - Peter Dankelmann; Dieter Rautenbach; Lutz Volkmann (Electron. Notes Discret. Math., 2000)

Average distance, minimum degree, and spanning trees. - Peter Dankelmann; Roger C. Entringer (J. Graph Theory, 2000)

Average distance in colored graphs. - Peter Dankelmann; Wayne Goddard; Peter J. Slater (J. Graph Theory, 2001)

Augmenting trees so that every three vertices lie on a cycle. - Peter Dankelmann; Wayne Goddard; Ortrud Oellermann; Henda C. Swart (Discret. Appl. Math., 2002)

Weighted domination in triangle-free graphs. - Peter Dankelmann; Dieter Rautenbach; Lutz Volkmann (Discret. Math., 2002)

Average lower independence in trees and outerplanar graphs. - Sheng Bau; Michael A. Henning; Peter Dankelmann (Ars Comb., 2003)

Twin Domination in Digraphs. - Gary Chartrand; Peter Dankelmann; Michelle Schultz; Henda C. Swart (Ars Comb., 2003)

MAD trees and distance-hereditary graphs. - Elias Dahlhaus; Peter Dankelmann; Wayne Goddard; Henda C. Swart (Discret. Appl. Math., 2003)

Bounds on the average connectivity of a graph. - Peter Dankelmann; Ortrud Oellermann (Discret. Appl. Math., 2003)

Factor domination and minimum degree. - Peter Dankelmann; Renu C. Laskar (Discret. Math., 2003)

On strong distances in oriented graphs. - Peter Dankelmann; Henda C. Swart; David P. Day (Discret. Math., 2003)

The Domatic Number of Regular Graphs. - Peter Dankelmann; Neil J. Calkin (Ars Comb., 2004)

Minimum average distance of strong orientations of graphs. - Peter Dankelmann; Ortrud Oellermann; Jian-Liang Wu 001 (Discret. Appl. Math., 2004)

Maximum sizes of graphs with given domination parameters. - Peter Dankelmann; Gayla S. Domke; Wayne Goddard; Paul J. P. Grobler; Johannes H. Hattingh; Henda C. Swart (Discret. Math., 2004)

A linear-time algorithm to compute a MAD tree of an interval graph. - Elias Dahlhaus; Peter Dankelmann; R. Ravi 001 (Inf. Process. Lett., 2004)

Degree Sequences of Optimally Edge-Connected Multigraphs. - Peter Dankelmann; Ortrud R. Oellermann (Ars Comb., 2005)

Average distance in k-connected tournaments. - Peter Dankelmann; Lutz Volkmann (Ars Comb., 2005)

The diameter of directed graphs. - Peter Dankelmann (J. Comb. Theory B, 2005)

Simultaneous graph parameters: Factor domination and factor total domination. - Peter Dankelmann; Michael A. Henning; Wayne Goddard; Renu C. Laskar (Discret. Math., 2006)

Trees with Equal Domination and Restrained Domination Numbers. - Peter Dankelmann; Johannes H. Hattingh; Michael A. Henning; Henda C. Swart (J. Glob. Optim., 2006)

Average distance in bipartite tournaments. - Peter Dankelmann; Lutz Volkmann (Ars Comb., 2007)

On the connectivity of diamond-free graphs. - Peter Dankelmann; Angelika Hellwig; Lutz Volkmann (Discret. Appl. Math., 2007)

On equality in an upper bound for the restrained and total domination numbers of a graph. - Peter Dankelmann; David P. Day; Johannes H. Hattingh; Michael A. Henning; Lisa R. Markus; Henda C. Swart (Discret. Math., 2007)

Embedding graphs as isometric medians. - Peter Dankelmann; Gert Sabidussi (Discret. Appl. Math., 2008)

Diameter and inverse degree. - Peter Dankelmann; Henda C. Swart; Paul van den Berg (Discret. Math., 2008)

Average Distance and Edge-Connectivity II. - Peter Dankelmann; Simon Mukwembi; Henda C. Swart (SIAM J. Discret. Math., 2008)

Average Distance and Edge-Connectivity I. - Peter Dankelmann; Simon Mukwembi; Henda C. Swart (SIAM J. Discret. Math., 2008)

On complexity of Minimum Leaf Out-Branching problem. - Peter Dankelmann; Gregory Z. Gutin; Eun Jung Kim 002 (Discret. Appl. Math., 2009)

On the degree distance of a graph. - Peter Dankelmann; Ivan Gutman; Simon Mukwembi; Henda C. Swart (Discret. Appl. Math., 2009)

Domination with exponential decay. - Peter Dankelmann; David P. Day; David Erwin; Simon Mukwembi; Henda C. Swart (Discret. Math., 2009)

The edge-Wiener index of a graph. - Peter Dankelmann; Ivan Gutman; Simon Mukwembi; Henda C. Swart (Discret. Math., 2009)

Inverse degree and edge-connectivity. - Peter Dankelmann; Angelika Hellwig; Lutz Volkmann (Discret. Math., 2009)

Diameter of 4-colourable graphs. - Éva Czabarka; Peter Dankelmann; László A. Székely (Eur. J. Comb., 2009)

Minimum size of a graph or digraph of given radius. - Peter Dankelmann; Lutz Volkmann (Inf. Process. Lett., 2009)

Average distance and vertex-connectivity. - Peter Dankelmann; Simon Mukwembi; Henda C. Swart (J. Graph Theory, 2009)

The Diameter of Almost Eulerian Digraphs. - Peter Dankelmann; Lutz Volkmann (Electron. J. Comb., 2010)

Average distance and generalised packing in graphs. - Peter Dankelmann (Discret. Math., 2010)

Hamiltonicity of k-Traceable Graphs. - Frank Bullock; Peter Dankelmann; Marietjie Frick; Michael A. Henning; Ortrud R. Oellermann; Susan A. van Aardt (Electron. J. Comb., 2011)

On the distance distribution of trees. - Peter Dankelmann (Discret. Appl. Math., 2011)

Degree distance of unicyclic and bicyclic graphs. - Aleksandar Ilic; Dragan Stevanovic; Lihua Feng; Guihai Yu; Peter Dankelmann (Discret. Appl. Math., 2011)

The number of edges in a bipartite graph of given radius. - Peter Dankelmann; Henda C. Swart; Paul van den Berg (Discret. Math., 2011)

Upper bounds on the Steiner diameter of a graph. - Patrick Ali; Peter Dankelmann; Simon Mukwembi (Discret. Appl. Math., 2012)

The radius of k-connected planar graphs with bounded faces. - Patrick Ali; Peter Dankelmann; Simon Mukwembi (Discret. Math., 2012)

Average distance in weighted graphs. - Peter Dankelmann (Discret. Math., 2012)

Eccentric counts, connectivity and chordality. - Peter Dankelmann; David Erwin; Wayne Goddard; Simon Mukwembi; Henda C. Swart (Inf. Process. Lett., 2012)

Automorphism group and diameter of a graph. - Peter Dankelmann; David Erwin; Simon Mukwembi; Bernardo Gabriel Rodrigues; Eric C. Mwambene; Gert Sabidussi (J. Graph Theory, 2012)

A Characterization of Graphs by Codes from their Incidence Matrices. - Peter Dankelmann; Jennifer D. Key; Bernardo Gabriel Rodrigues (Electron. J. Comb., 2013)

Codes from incidence matrices of graphs. - Peter Dankelmann; Jennifer D. Key; Bernardo Gabriel Rodrigues (Des. Codes Cryptogr., 2013)

A characterisation of eccentric sequences of maximal outerplanar graphs. - Peter Dankelmann; David Erwin; Wayne Goddard; Simon Mukwembi; Henda C. Swart (Australas. J Comb., 2014)

Steiner diameter of 3, 4 and 5-connected maximal planar graphs. - Patrick Ali; Simon Mukwembi; Peter Dankelmann (Discret. Appl. Math., 2014)

Upper bounds on the average eccentricity. - Peter Dankelmann; Simon Mukwembi (Discret. Appl. Math., 2014)

The Degree-Diameter Problem for Claw-Free Graphs and Hypergraphs. - Peter Dankelmann; Tomás Vetrík (J. Graph Theory, 2014)

Proximity, remoteness and minimum degree. - Peter Dankelmann (Discret. Appl. Math., 2015)

Distance and size in digraphs. - Peter Dankelmann (Discret. Math., 2015)

Diameter of orientations of graphs with given minimum degree. - Sheng Bau; Peter Dankelmann (Eur. J. Comb., 2015)

On the Number of Resolving Pairs in Graphs. - Peter Dankelmann (Graphs Comb., 2015)

Diameter and maximum degree in Eulerian digraphs. - Peter Dankelmann; Michael Dorfling (Discret. Math., 2016)

Maximally edge-connected hypergraphs. - Peter Dankelmann; Dirk Meierling (Discret. Math., 2016)

The degree-diameter problem for outerplanar graphs. - Peter Dankelmann; Elizabeth Jonck; Tomás Vetrík (Discuss. Math. Graph Theory, 2017)

Bounds on the fault-diameter of graphs. - Peter Dankelmann (Networks, 2017)

Oriented diameter of graphs with given maximum degree. - Peter Dankelmann; Yubao Guo; Michel Surmacs (J. Graph Theory, 2018)

Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension. - Laurent Beaudou; Peter Dankelmann; Florent Foucaud; Michael A. Henning; Arnaud Mary; Aline Parreau (SIAM J. Discret. Math., 2018)

Distance and Eccentric sequences to bound the Wiener index, Hosoya polynomial and the average eccentricity in the strong products of graphs. - Rocío M. Casablanca; Peter Dankelmann (Discret. Appl. Math., 2019)

On average distance in tournaments and Eulerian digraphs. - Peter Dankelmann (Discret. Appl. Math., 2019)

The Steiner k-Wiener index of graphs with given minimum degree. - Peter Dankelmann (Discret. Appl. Math., 2019)

Upper bounds on the average eccentricity of K3-free and C4-free graphs. - Peter Dankelmann; Fadekemi Janet Osaye; Simon Mukwembi; Bernardo Gabriel Rodrigues (Discret. Appl. Math., 2019)

A degree condition for diameter two orientability of graphs. - Éva Czabarka; Peter Dankelmann; László A. Székely (Discret. Math., 2019)

Average eccentricity, k-packing and k-domination in graphs. - Peter Dankelmann; Fadekemi Janet Osaye (Discret. Math., 2019)

Average eccentricity, minimum degree and maximum degree in graphs. - Peter Dankelmann; Fadekemi Janet Osaye (J. Comb. Optim., 2020)

Distance domination and generalized eccentricity in graphs with given minimum degree. - Peter Dankelmann; David J. Erwin (J. Graph Theory, 2020)

Distances in graphs of girth 6 and generalised cages. - Alex Alochukwu; Peter Dankelmann (Discret. Appl. Math., 2021)

Proof of a conjecture on the Wiener index of Eulerian graphs. - Peter Dankelmann (Discret. Appl. Math., 2021)

Proximity and remoteness in triangle-free and C4-free graphs in terms of order and minimum degree. - Peter Dankelmann; Elizabeth Jonck; Sonwabile Mafunda (Discret. Math., 2021)

Steiner diameter, maximum degree and size of a graph. - Yaping Mao; Peter Dankelmann; Zhao Wang 007 (Discret. Math., 2021)

Wiener Index and Remoteness in Triangulations and Quadrangulations. - Éva Czabarka; Peter Dankelmann; Trevor Olsen; László A. Székely (Discret. Math. Theor. Comput. Sci., 2021)

Wiener index in graphs with given minimum degree and maximum degree. - Peter Dankelmann; Alex Alochukwu (Discret. Math. Theor. Comput. Sci., 2021)

A Size Condition for Diameter Two Orientable Graphs. - Garner Cochran; Éva Czabarka; Peter Dankelmann; László A. Székely (Graphs Comb., 2021)

Oriented diameter of maximal outerplanar graphs. - Xiaolin Wang; Yaojun Chen; Peter Dankelmann; Yubao Guo; Michel Surmacs; Lutz Volkmann (J. Graph Theory, 2021)

On the difference between proximity and other distance parameters in triangle-free graphs and C4-free graphs. - Peter Dankelmann; Sonwabile Mafunda (Discret. Appl. Math., 2022)

Proximity, remoteness and maximum degree in graphs. - Peter Dankelmann; Sonwabile Mafunda; Sufiyan Mallu (Discret. Math. Theor. Comput. Sci., 2022)

Proximity in triangulations and quadrangulations. - Éva Czabarka; Peter Dankelmann; Trevor Olsen; László A. Székely (Electron. J. Graph Theory Appl., 2022)

The maximum average connectivity among all orientations of a graph. - Rocío M. Casablanca; Peter Dankelmann; Wayne Goddard; Lucas Mol; Ortrud Oellermann (J. Comb. Optim., 2022)

On subgraphs with prescribed eccentricities. - Peter Dankelmann; Matthew DeVilbiss; David J. Erwin; Kelly Guest; Ryan Matzke (Discuss. Math. Graph Theory, 2023)

Metric dimension and diameter in bipartite graphs. - Peter Dankelmann; Jane Morgan; Emily Rivett-Carnac (Discuss. Math. Graph Theory, 2023)

On Wiener index and average eccentricity of graphs of girth at least 6 and (C4,C5)-free graphs. - Alex Alochukwu; Peter Dankelmann (Discret. Appl. Math., 2023)

On the Wiener index of orientations of graphs. - Peter Dankelmann (Discret. Appl. Math., 2023)

Edge-fault diameter of C4-free graphs. - Alex Alochukwu; Peter Dankelmann (Discret. Math., 2024)

The Oriented Diameter of Graphs with Given Connected Domination Number and Distance Domination Number. - Peter Dankelmann; Jane Morgan; Emily Rivett-Carnac (Graphs Comb., 2024)

On the edge-connectivity of the square of a graph. - Camino Balbuena; Peter Dankelmann (Discret. Appl. Math., 2025)

The oriented diameter of graphs derived from other graphs. - Peter Dankelmann; Y. Guo; Emily Rivett-Carnac; Lutz Volkmann (Discret. Math., 2025)

Remoteness of graphs with given size and connectivity constraints. - Peter Dankelmann; Sonwabile Mafunda; Sufiyan Mallu (Discret. Math., 2025)