According to our database
1,
Peter Dankelmann
authored at least 99 papers
between 1993 and 2024.
Collaborative distances:
-
Dijkstra number2 of
four.
-
Erdős number3 of
two.
2024
The Oriented Diameter of Graphs with Given Connected Domination Number and Distance Domination Number.
Graphs Comb., February, 2024
Edge-fault diameter of <i>C</i><sub>4</sub>-free graphs.
Discret. Math., January, 2024
2023
On the Wiener index of orientations of graphs.
Discret. Appl. Math., September, 2023
On Wiener index and average eccentricity of graphs of girth at least 6 and (C4,C5)-free graphs.
Discret. Appl. Math., May, 2023
Metric dimension and diameter in bipartite graphs.
Discuss. Math. Graph Theory, 2023
On subgraphs with prescribed eccentricities.
Discuss. Math. Graph Theory, 2023
2022
The maximum average connectivity among all orientations of a graph.
J. Comb. Optim., 2022
Proximity in triangulations and quadrangulations.
Electron. J. Graph Theory Appl., 2022
Proximity, remoteness and maximum degree in graphs.
Discret. Math. Theor. Comput. Sci., 2022
On the difference between proximity and other distance parameters in triangle-free graphs and C4-free graphs.
Discret. Appl. Math., 2022
2021
Oriented diameter of maximal outerplanar graphs.
J. Graph Theory, 2021
A Size Condition for Diameter Two Orientable Graphs.
Graphs Comb., 2021
Wiener index in graphs with given minimum degree and maximum degree.
Discret. Math. Theor. Comput. Sci., 2021
Wiener Index and Remoteness in Triangulations and Quadrangulations.
Discret. Math. Theor. Comput. Sci., 2021
Steiner diameter, maximum degree and size of a graph.
Discret. Math., 2021
Proximity and remoteness in triangle-free and <i>C</i><sub>4</sub>-free graphs in terms of order and minimum degree.
Discret. Math., 2021
Proof of a conjecture on the Wiener index of Eulerian graphs.
Discret. Appl. Math., 2021
Distances in graphs of girth 6 and generalised cages.
Discret. Appl. Math., 2021
2020
Distance domination and generalized eccentricity in graphs with given minimum degree.
J. Graph Theory, 2020
Average eccentricity, minimum degree and maximum degree in graphs.
J. Comb. Optim., 2020
2019
Average eccentricity, k-packing and k-domination in graphs.
Discret. Math., 2019
A degree condition for diameter two orientability of graphs.
Discret. Math., 2019
Upper bounds on the average eccentricity of K3-free and C4-free graphs.
Discret. Appl. Math., 2019
The Steiner k-Wiener index of graphs with given minimum degree.
Discret. Appl. Math., 2019
On average distance in tournaments and Eulerian digraphs.
Discret. Appl. Math., 2019
Distance and Eccentric sequences to bound the Wiener index, Hosoya polynomial and the average eccentricity in the strong products of graphs.
Discret. Appl. Math., 2019
2018
Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension.
SIAM J. Discret. Math., 2018
Oriented diameter of graphs with given maximum degree.
J. Graph Theory, 2018
2017
Bounds on the fault-diameter of graphs.
Networks, 2017
The degree-diameter problem for outerplanar graphs.
Discuss. Math. Graph Theory, 2017
2016
Maximally edge-connected hypergraphs.
Discret. Math., 2016
Diameter and maximum degree in Eulerian digraphs.
Discret. Math., 2016
2015
On the Number of Resolving Pairs in Graphs.
Graphs Comb., 2015
Diameter of orientations of graphs with given minimum degree.
Eur. J. Comb., 2015
Distance and size in digraphs.
Discret. Math., 2015
Proximity, remoteness and minimum degree.
Discret. Appl. Math., 2015
2014
The Degree-Diameter Problem for Claw-Free Graphs and Hypergraphs.
J. Graph Theory, 2014
Upper bounds on the average eccentricity.
Discret. Appl. Math., 2014
Steiner diameter of 3, 4 and 5-connected maximal planar graphs.
Discret. Appl. Math., 2014
A characterisation of eccentric sequences of maximal outerplanar graphs.
Australas. J Comb., 2014
2013
Codes from incidence matrices of graphs.
Des. Codes Cryptogr., 2013
A Characterization of Graphs by Codes from their Incidence Matrices.
Electron. J. Comb., 2013
2012
Automorphism group and diameter of a graph.
J. Graph Theory, 2012
Eccentric counts, connectivity and chordality.
Inf. Process. Lett., 2012
Average distance in weighted graphs.
Discret. Math., 2012
The radius of k-connected planar graphs with bounded faces.
Discret. Math., 2012
Upper bounds on the Steiner diameter of a graph.
Discret. Appl. Math., 2012
2011
The number of edges in a bipartite graph of given radius.
Discret. Math., 2011
Degree distance of unicyclic and bicyclic graphs.
Discret. Appl. Math., 2011
On the distance distribution of trees.
Discret. Appl. Math., 2011
Hamiltonicity of <i>k</i>-Traceable Graphs.
Electron. J. Comb., 2011
2010
Average distance and generalised packing in graphs.
Discret. Math., 2010
The Diameter of Almost Eulerian Digraphs.
Electron. J. Comb., 2010
2009
Average distance and vertex-connectivity.
J. Graph Theory, 2009
Minimum size of a graph or digraph of given radius.
Inf. Process. Lett., 2009
Diameter of 4-colourable graphs.
Eur. J. Comb., 2009
Inverse degree and edge-connectivity.
Discret. Math., 2009
The edge-Wiener index of a graph.
Discret. Math., 2009
Domination with exponential decay.
Discret. Math., 2009
On the degree distance of a graph.
Discret. Appl. Math., 2009
On complexity of Minimum Leaf Out-Branching problem.
Discret. Appl. Math., 2009
2008
Average Distance and Edge-Connectivity I.
SIAM J. Discret. Math., 2008
Average Distance and Edge-Connectivity II.
SIAM J. Discret. Math., 2008
Diameter and inverse degree.
Discret. Math., 2008
Embedding graphs as isometric medians.
Discret. Appl. Math., 2008
2007
On equality in an upper bound for the restrained and total domination numbers of a graph.
Discret. Math., 2007
On the connectivity of diamond-free graphs.
Discret. Appl. Math., 2007
Average distance in bipartite tournaments.
Ars Comb., 2007
2006
Trees with Equal Domination and Restrained Domination Numbers.
J. Glob. Optim., 2006
Simultaneous graph parameters: Factor domination and factor total domination.
Discret. Math., 2006
2005
The diameter of directed graphs.
J. Comb. Theory B, 2005
Average distance in k-connected tournaments.
Ars Comb., 2005
Degree Sequences of Optimally Edge-Connected Multigraphs.
Ars Comb., 2005
2004
A linear-time algorithm to compute a MAD tree of an interval graph.
Inf. Process. Lett., 2004
Maximum sizes of graphs with given domination parameters.
Discret. Math., 2004
Minimum average distance of strong orientations of graphs.
Discret. Appl. Math., 2004
The Domatic Number of Regular Graphs.
Ars Comb., 2004
2003
On strong distances in oriented graphs.
Discret. Math., 2003
Factor domination and minimum degree.
Discret. Math., 2003
Bounds on the average connectivity of a graph.
Discret. Appl. Math., 2003
MAD trees and distance-hereditary graphs.
Discret. Appl. Math., 2003
Twin Domination in Digraphs.
Ars Comb., 2003
Average lower independence in trees and outerplanar graphs.
Ars Comb., 2003
2002
Weighted domination in triangle-free graphs.
Discret. Math., 2002
Augmenting trees so that every three vertices lie on a cycle.
Discret. Appl. Math., 2002
2001
Average distance in colored graphs.
J. Graph Theory, 2001
2000
Average distance, minimum degree, and spanning trees.
J. Graph Theory, 2000
Some results on graph parameters in weighted graphs.
Electron. Notes Discret. Math., 2000
Degree sequence conditions for maximally edge-connected graphs depending on the clique number.
Discret. Math., 2000
1999
Generalized eccentricity, radius, and diameter in graphs.
Networks, 1999
1998
Radius-forcing sets in graphs.
Australas. J Comb., 1998
1997
Degree sequence conditions for maximally edge-connected graphs and digraphs.
J. Graph Theory, 1997
On the Average Steiner Distance of Graphs with Prescribed Properties.
Discret. Appl. Math., 1997
Average Distance and Domination Number.
Discret. Appl. Math., 1997
1996
The average Steiner distance of a graph.
J. Graph Theory, 1996
1995
New sufficient conditions for equality of minimum degree and edge-connectivity.
Ars Comb., 1995
1994
SIAM J. Discret. Math., 1994
Average Distance and Independence Number.
Discret. Appl. Math., 1994
1993
Computing the Average Distance of an Interval Graph.
Inf. Process. Lett., 1993
