Peter Dankelmann

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