default search action
Peter Dankelmann
Person information
- affiliation: University of Johannesburg, South Africa
- affiliation (PhD 1993): RWTH Aachen University, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j99]Alex Alochukwu
, Peter Dankelmann
Edge-fault diameter of C4-free graphs. Discret. Math. 347(1): 113678 (2024) - [j98]Peter Dankelmann
The Oriented Diameter of Graphs with Given Connected Domination Number and Distance Domination Number. Graphs Comb. 40(1): 18 (2024) - 2023
- [j97]Alex Alochukwu
On Wiener index and average eccentricity of graphs of girth at least 6 and (C4,C5)-free graphs. Discret. Appl. Math. 330: 98-111 (2023) - [j96]Peter Dankelmann
On the Wiener index of orientations of graphs. Discret. Appl. Math. 336: 125-131 (2023) - [j95]Peter Dankelmann, Jane Morgan, Emily Rivett-Carnac:
Metric dimension and diameter in bipartite graphs. Discuss. Math. Graph Theory 43(2): 487-498 (2023) - [j94]Peter Dankelmann, Matthew DeVilbiss, David J. Erwin
On subgraphs with prescribed eccentricities. Discuss. Math. Graph Theory 43(3): 685-702 (2023) - 2022
- [j93]Peter Dankelmann
On the difference between proximity and other distance parameters in triangle-free graphs and C4-free graphs. Discret. Appl. Math. 321: 295-307 (2022) - [j92]Peter Dankelmann, Sonwabile Mafunda, Sufiyan Mallu:
Proximity, remoteness and maximum degree in graphs. Discret. Math. Theor. Comput. Sci. 24(2) (2022) - [j91]Éva Czabarka, Peter Dankelmann, Trevor Olsen, László A. Székely:
Proximity in triangulations and quadrangulations. Electron. J. Graph Theory Appl. 10(2): 425-446 (2022) - [j90]Rocío M. Casablanca, Peter Dankelmann, Wayne Goddard, Lucas Mol
The maximum average connectivity among all orientations of a graph. J. Comb. Optim. 43(3): 543-570 (2022) - 2021
- [j89]Alex Alochukwu
Distances in graphs of girth 6 and generalised cages. Discret. Appl. Math. 294: 125-137 (2021) - [j88]Peter Dankelmann
Proof of a conjecture on the Wiener index of Eulerian graphs. Discret. Appl. Math. 301: 99-108 (2021) - [j87]Yaping Mao
Steiner diameter, maximum degree and size of a graph. Discret. Math. 344(8): 112468 (2021) - [j86]Peter Dankelmann
Proximity and remoteness in triangle-free and C4-free graphs in terms of order and minimum degree. Discret. Math. 344(9): 112513 (2021) - [j85]Éva Czabarka
Wiener Index and Remoteness in Triangulations and Quadrangulations. Discret. Math. Theor. Comput. Sci. 23(1) (2021) - [j84]Peter Dankelmann, Alex Alochukwu
Wiener index in graphs with given minimum degree and maximum degree. Discret. Math. Theor. Comput. Sci. 23(1) (2021) - [j83]Garner Cochran, Éva Czabarka, Peter Dankelmann
A Size Condition for Diameter Two Orientable Graphs. Graphs Comb. 37(2): 527-544 (2021) - [j82]Xiaolin Wang
Oriented diameter of maximal outerplanar graphs. J. Graph Theory 98(3): 426-444 (2021) - 2020
- [j81]Peter Dankelmann
Average eccentricity, minimum degree and maximum degree in graphs. J. Comb. Optim. 40(3): 697-712 (2020) - [j80]Peter Dankelmann, David J. Erwin
Distance domination and generalized eccentricity in graphs with given minimum degree. J. Graph Theory 94(1): 5-19 (2020)
2010 – 2019
- 2019
- [j79]Rocío M. Casablanca
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: 105-117 (2019) - [j78]Peter Dankelmann
On average distance in tournaments and Eulerian digraphs. Discret. Appl. Math. 266: 38-47 (2019) - [j77]Peter Dankelmann:
The Steiner k-Wiener index of graphs with given minimum degree. Discret. Appl. Math. 268: 35-43 (2019) - [j76]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: 106-114 (2019) - [j75]Éva Czabarka
A degree condition for diameter two orientability of graphs. Discret. Math. 342(4): 1063-1065 (2019) - [j74]Peter Dankelmann
Average eccentricity, k-packing and k-domination in graphs. Discret. Math. 342(5): 1261-1274 (2019) - 2018
- [j73]Peter Dankelmann, Yubao Guo, Michel Surmacs
Oriented diameter of graphs with given maximum degree. J. Graph Theory 88(1): 5-17 (2018) - [j72]Laurent Beaudou, Peter Dankelmann, Florent Foucaud, Michael A. Henning, Arnaud Mary
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): 902-918 (2018) - 2017
- [j71]Peter Dankelmann
The degree-diameter problem for outerplanar graphs. Discuss. Math. Graph Theory 37(3): 823-834 (2017) - [j70]Peter Dankelmann:
Bounds on the fault-diameter of graphs. Networks 70(2): 132-140 (2017) - 2016
- [j69]Peter Dankelmann
Maximally edge-connected hypergraphs. Discret. Math. 339(1): 33-38 (2016) - [j68]Peter Dankelmann
Diameter and maximum degree in Eulerian digraphs. Discret. Math. 339(4): 1355-1361 (2016) - 2015
- [j67]Peter Dankelmann
Proximity, remoteness and minimum degree. Discret. Appl. Math. 184: 223-228 (2015) - [j66]Peter Dankelmann
Distance and size in digraphs. Discret. Math. 338(1): 144-148 (2015) - [j65]Sheng Bau, Peter Dankelmann
Diameter of orientations of graphs with given minimum degree. Eur. J. Comb. 49: 126-133 (2015) - [j64]Peter Dankelmann
On the Number of Resolving Pairs in Graphs. Graphs Comb. 31(6): 2175-2180 (2015) - 2014
- [j63]Peter Dankelmann, David Erwin, Wayne Goddard, Simon Mukwembi, Henda C. Swart:
A characterisation of eccentric sequences of maximal outerplanar graphs. Australas. J Comb. 58: 376- (2014) - [j62]Peter Dankelmann
Upper bounds on the average eccentricity. Discret. Appl. Math. 167: 72-79 (2014) - [j61]Patrick Ali, Simon Mukwembi, Peter Dankelmann
Steiner diameter of 3, 4 and 5-connected maximal planar graphs. Discret. Appl. Math. 179: 222-228 (2014) - [j60]Peter Dankelmann
The Degree-Diameter Problem for Claw-Free Graphs and Hypergraphs. J. Graph Theory 75(2): 105-123 (2014) - 2013
- [j59]Peter Dankelmann, Jennifer D. Key, Bernardo Gabriel Rodrigues:
A Characterization of Graphs by Codes from their Incidence Matrices. Electron. J. Comb. 20(3): 18 (2013) - [j58]Peter Dankelmann
Codes from incidence matrices of graphs. Des. Codes Cryptogr. 68(1-3): 373-393 (2013) - 2012
- [j57]Patrick Ali, Peter Dankelmann
Upper bounds on the Steiner diameter of a graph. Discret. Appl. Math. 160(12): 1845-1850 (2012) - [j56]Peter Dankelmann
Average distance in weighted graphs. Discret. Math. 312(1): 12-20 (2012) - [j55]Patrick Ali, Peter Dankelmann
The radius of k-connected planar graphs with bounded faces. Discret. Math. 312(24): 3636-3642 (2012) - [j54]Peter Dankelmann
Eccentric counts, connectivity and chordality. Inf. Process. Lett. 112(24): 944-947 (2012) - [j53]Peter Dankelmann
Automorphism group and diameter of a graph. J. Graph Theory 70(1): 80-91 (2012) - 2011
- [j52]Frank Bullock, Peter Dankelmann, Marietjie Frick, Michael A. Henning, Ortrud R. Oellermann, Susan A. van Aardt:
Hamiltonicity of k-Traceable Graphs. Electron. J. Comb. 18(1) (2011) - [j51]Aleksandar Ilic, Dragan Stevanovic
Degree distance of unicyclic and bicyclic graphs. Discret. Appl. Math. 159(8): 779-788 (2011) - [j50]Peter Dankelmann
On the distance distribution of trees. Discret. Appl. Math. 159(10): 945-952 (2011) - [j49]Peter Dankelmann
The number of edges in a bipartite graph of given radius. Discret. Math. 311(8-9): 690-698 (2011) - 2010
- [j48]Peter Dankelmann, Lutz Volkmann:
The Diameter of Almost Eulerian Digraphs. Electron. J. Comb. 17(1) (2010) - [j47]Peter Dankelmann
Average distance and generalised packing in graphs. Discret. Math. 310(17-18): 2334-2344 (2010)
2000 – 2009
- 2009
- [j46]Peter Dankelmann
On the degree distance of a graph. Discret. Appl. Math. 157(13): 2773-2777 (2009) - [j45]Peter Dankelmann
On complexity of Minimum Leaf Out-Branching problem. Discret. Appl. Math. 157(13): 3000-3004 (2009) - [j44]Peter Dankelmann
Inverse degree and edge-connectivity. Discret. Math. 309(9): 2943-2947 (2009) - [j43]Peter Dankelmann
The edge-Wiener index of a graph. Discret. Math. 309(10): 3452-3457 (2009) - [j42]Peter Dankelmann
Domination with exponential decay. Discret. Math. 309(19): 5877-5883 (2009) - [j41]Éva Czabarka
Diameter of 4-colourable graphs. Eur. J. Comb. 30(5): 1082-1089 (2009) - [j40]Peter Dankelmann
Minimum size of a graph or digraph of given radius. Inf. Process. Lett. 109(16): 971-973 (2009) - [j39]Peter Dankelmann
Average distance and vertex-connectivity. J. Graph Theory 62(2): 157-177 (2009) - 2008
- [j38]Peter Dankelmann
Embedding graphs as isometric medians. Discret. Appl. Math. 156(12): 2420-2422 (2008) - [j37]Peter Dankelmann
Diameter and inverse degree. Discret. Math. 308(5-6): 670-673 (2008) - [j36]Peter Dankelmann
Average Distance and Edge-Connectivity II. SIAM J. Discret. Math. 21(4): 1035-1052 (2008) - [j35]Peter Dankelmann
Average Distance and Edge-Connectivity I. SIAM J. Discret. Math. 22(1): 92-101 (2008) - [i1]Peter Dankelmann, Gregory Z. Gutin, Eun Jung Kim:
On Complexity of Minimum Leaf Out-branching Problem. CoRR abs/0808.0980 (2008) - 2007
- [j34]Peter Dankelmann, Lutz Volkmann:
Average distance in bipartite tournaments. Ars Comb. 83 (2007) - [j33]Peter Dankelmann
On the connectivity of diamond-free graphs. Discret. Appl. Math. 155(16): 2111-2117 (2007) - [j32]Peter Dankelmann
On equality in an upper bound for the restrained and total domination numbers of a graph. Discret. Math. 307(22): 2845-2852 (2007) - 2006
- [j31]Peter Dankelmann
Simultaneous graph parameters: Factor domination and factor total domination. Discret. Math. 306(18): 2229-2233 (2006) - [j30]Peter Dankelmann
Trees with Equal Domination and Restrained Domination Numbers. J. Glob. Optim. 34(4): 597-607 (2006) - 2005
- [j29]Peter Dankelmann, Ortrud R. Oellermann:
Degree Sequences of Optimally Edge-Connected Multigraphs. Ars Comb. 77 (2005) - [j28]Peter Dankelmann, Lutz Volkmann:
Average distance in k-connected tournaments. Ars Comb. 77 (2005) - [j27]Peter Dankelmann
The diameter of directed graphs. J. Comb. Theory B 94(1): 183-186 (2005) - 2004
- [j26]Peter Dankelmann, Neil J. Calkin:
The Domatic Number of Regular Graphs. Ars Comb. 73 (2004) - [j25]Peter Dankelmann
Minimum average distance of strong orientations of graphs. Discret. Appl. Math. 143(1-3): 204-212 (2004) - [j24]Peter Dankelmann
Maximum sizes of graphs with given domination parameters. Discret. Math. 281(1-3): 137-148 (2004) - [j23]Elias Dahlhaus, Peter Dankelmann
A linear-time algorithm to compute a MAD tree of an interval graph. Inf. Process. Lett. 89(5): 255-259 (2004) - 2003
- [j22]Gary Chartrand, Peter Dankelmann, Michelle Schultz, Henda C. Swart:
Twin Domination in Digraphs. Ars Comb. 67 (2003) - [j21]Sheng Bau, Michael A. Henning, Peter Dankelmann:
Average lower independence in trees and outerplanar graphs. Ars Comb. 69 (2003) - [j20]Peter Dankelmann, Ortrud Oellermann:
Bounds on the average connectivity of a graph. Discret. Appl. Math. 129(2-3): 305-318 (2003) - [j19]Elias Dahlhaus, Peter Dankelmann
MAD trees and distance-hereditary graphs. Discret. Appl. Math. 131(1): 151-167 (2003) - [j18]Peter Dankelmann
Factor domination and minimum degree. Discret. Math. 262(1-3): 113-119 (2003) - [j17]Peter Dankelmann
On strong distances in oriented graphs. Discret. Math. 266(1-3): 195-201 (2003) - 2002
- [j16]Peter Dankelmann
Augmenting trees so that every three vertices lie on a cycle. Discret. Appl. Math. 116(1-2): 145-159 (2002) - [j15]Peter Dankelmann, Dieter Rautenbach, Lutz Volkmann:
Weighted domination in triangle-free graphs. Discret. Math. 250(1-3): 233-239 (2002) - 2001
- [j14]Peter Dankelmann, Wayne Goddard, Peter J. Slater:
Average distance in colored graphs. J. Graph Theory 38(1): 1-17 (2001) - 2000
- [j13]Peter Dankelmann, Lutz Volkmann:
Degree sequence conditions for maximally edge-connected graphs depending on the clique number. Discret. Math. 211: 217-223 (2000) - [j12]Peter Dankelmann
Some results on graph parameters in weighted graphs. Electron. Notes Discret. Math. 5: 85-88 (2000) - [j11]Peter Dankelmann, Roger C. Entringer:
Average distance, minimum degree, and spanning trees. J. Graph Theory 33(1): 1-13 (2000)
1990 – 1999
- 1999
- [j10]Peter Dankelmann, Wayne Goddard, Michael A. Henning, Henda C. Swart:
Generalized eccentricity, radius, and diameter in graphs. Networks 34(4): 312-319 (1999) - 1998
- [j9]Peter Dankelmann, Vivienne Smithdorf, Henda C. Swart:
Radius-forcing sets in graphs. Australas. J Comb. 17: 39-50 (1998) - 1997
- [j8]Peter Dankelmann, Henda C. Swart, Ortrud Oellermann:
On the Average Steiner Distance of Graphs with Prescribed Properties. Discret. Appl. Math. 79(1-3): 91-103 (1997) - [j7]Peter Dankelmann:
Average Distance and Domination Number. Discret. Appl. Math. 80(1): 21-35 (1997) - [j6]Peter Dankelmann, Lutz Volkmann:
Degree sequence conditions for maximally edge-connected graphs and digraphs. J. Graph Theory 26(1): 27-34 (1997) - 1996
- [j5]Peter Dankelmann, Ortrud R. Oellermann, Henda C. Swart:
The average Steiner distance of a graph. J. Graph Theory 22(1): 15-22 (1996) - 1995
- [j4]Peter Dankelmann, Lutz Volkmann:
New sufficient conditions for equality of minimum degree and edge-connectivity. Ars Comb. 40 (1995) - 1994
- [j3]Peter Dankelmann
Average Distance and Independence Number. Discret. Appl. Math. 51(1-2): 75-83 (1994) - [j2]Peter Dankelmann, Thomas Niessen, Ingo Schiermeyer:
On Path-Tough Graphs. SIAM J. Discret. Math. 7(4): 571-584 (1994) - 1993
- [j1]Peter Dankelmann
Computing the Average Distance of an Interval Graph. Inf. Process. Lett. 48(6): 311-314 (1993)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: