Peter Dankelmann

1.7k total citations
95 papers, 1.0k citations indexed

About

Peter Dankelmann is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Computer Networks and Communications. According to data from OpenAlex, Peter Dankelmann has authored 95 papers receiving a total of 1.0k indexed citations (citations by other indexed papers that have themselves been cited), including 86 papers in Computational Theory and Mathematics, 57 papers in Geometry and Topology and 41 papers in Computer Networks and Communications. Recurrent topics in Peter Dankelmann's work include Advanced Graph Theory Research (80 papers), Graph theory and applications (57 papers) and Interconnection Networks and Systems (38 papers). Peter Dankelmann is often cited by papers focused on Advanced Graph Theory Research (80 papers), Graph theory and applications (57 papers) and Interconnection Networks and Systems (38 papers). Peter Dankelmann collaborates with scholars based in South Africa, Germany and United States. Peter Dankelmann's co-authors include Henda C. Swart, Simon Mukwembi, Lutz Volkmann, Ortrud R. Oellermann, İvan Gutman, R. C. Entringer, Angelika Hellwig, David P. Day, Michael A. Henning and Wayne Goddard and has published in prestigious journals such as SHILAP Revista de lepidopterología, Networks and Discrete Applied Mathematics.

In The Last Decade

Peter Dankelmann

89 papers receiving 990 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Peter Dankelmann South Africa	19	837	705	354	162	133	95	1.0k
Huiqing Liu China	16	496 0.6×	551 0.8×	219 0.6×	237 1.5×	116 0.9×	69	757
Domingos M. Cardoso Portugal	14	470 0.6×	494 0.7×	96 0.3×	197 1.2×	172 1.3×	70	763
Wai Chee Shiu Hong Kong	18	918 1.1×	723 1.0×	110 0.3×	319 2.0×	219 1.6×	185	1.3k
Henda C. Swart South Africa	15	516 0.6×	440 0.6×	157 0.4×	126 0.8×	102 0.8×	50	663
Huiqiu Lin China	17	647 0.8×	823 1.2×	133 0.4×	215 1.3×	269 2.0×	93	943
Mustapha Aouchiche Canada	18	872 1.0×	1.0k 1.4×	88 0.2×	377 2.3×	161 1.2×	79	1.2k
Shenggui Zhang China	15	592 0.7×	392 0.6×	128 0.4×	106 0.7×	245 1.8×	126	872
Odile Favaron France	23	1.6k 1.9×	649 0.9×	408 1.2×	142 0.9×	443 3.3×	111	1.8k
Ioan Tomescu Romania	15	758 0.9×	506 0.7×	89 0.3×	105 0.6×	140 1.1×	102	963
S. Toida Canada	7	355 0.4×	463 0.7×	167 0.5×	208 1.3×	119 0.9×	18	769

Countries citing papers authored by Peter Dankelmann

Since Specialization

Citations

This map shows the geographic impact of Peter Dankelmann's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Peter Dankelmann with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Peter Dankelmann more than expected).

Fields of papers citing papers by Peter Dankelmann

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Peter Dankelmann. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Peter Dankelmann. The network helps show where Peter Dankelmann may publish in the future.

Co-authorship network of co-authors of Peter Dankelmann

This figure shows the co-authorship network connecting the top 25 collaborators of Peter Dankelmann. A scholar is included among the top collaborators of Peter Dankelmann based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Peter Dankelmann. Peter Dankelmann is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Dankelmann, Peter, et al.. (2024). The Oriented Diameter of Graphs with Given Connected Domination Number and Distance Domination Number. Graphs and Combinatorics. 40(1). 1 indexed citations

Dankelmann, Peter, et al.. (2023). On Wiener index and average eccentricity of graphs of girth at least 6 and (C4,C5)-free graphs. Discrete Applied Mathematics. 330. 98–111.

Dankelmann, Peter, et al.. (2023). Edge-fault diameter of C4-free graphs. Discrete Mathematics. 347(1). 113678–113678.

Dankelmann, Peter, et al.. (2022). On the difference between proximity and other distance parameters in triangle-free graphs and C4-free graphs. Discrete Applied Mathematics. 321. 295–307. 1 indexed citations

Dankelmann, Peter, et al.. (2021). The maximum average connectivity among all orientations of a graph. idUS (Universidad de Sevilla). 1 indexed citations

Dankelmann, Peter, et al.. (2021). Distances in graphs of girth 6 and generalised cages. Discrete Applied Mathematics. 294. 125–137. 2 indexed citations

Dankelmann, Peter. (2019). On the edge-connectivity of C_4-free graphs. 4(2). 141–150. 1 indexed citations

Dankelmann, Peter, et al.. (2018). Distance and Eccentric sequences to bound the Wiener index, Hosoya polynomial and the average eccentricity in the strong products of graphs. Discrete Applied Mathematics. 263. 105–117. 9 indexed citations

Dankelmann, Peter. (2016). New bounds on proximity and remoteness in graphs. SHILAP Revista de lepidopterología. 6 indexed citations

10.

Dankelmann, Peter, Angelika Hellwig, & Lutz Volkmann. (2008). Inverse degree and edge-connectivity. Discrete Mathematics. 309(9). 2943–2947. 40 indexed citations

11.

Dankelmann, Peter & Lutz Volkmann. (2007). Average distance in bipartite tournaments. Ars Combinatoria. 83. 1 indexed citations

12.

Dankelmann, Peter, Henda C. Swart, & Paul van den Berg. (2007). Diameter and inverse degree. Discrete Mathematics. 308(5-6). 670–673. 25 indexed citations

13.

Dankelmann, Peter & Ortrud R. Oellermann. (2005). Degree Sequences of Optimally Edge-Connected Multigraphs.. Ars Combinatoria. 77. 2 indexed citations

14.

Dankelmann, Peter & Neil J. Calkin. (2004). The Domatic Number of Regular Graphs.. Ars Combinatoria. 73. 13 indexed citations

15.

Henning, Michael A., et al.. (2003). Average lower independence in trees and outerplanar graphs.. Ars Combinatoria. 69. 1 indexed citations

16.

Chartrand, Gary, et al.. (2003). Twin Domination in Digraphs.. Ars Combinatoria. 67. 19 indexed citations

17.

Dankelmann, Peter & Renu Laskar. (2003). Factor domination and minimum degree. Discrete Mathematics. 262(1-3). 113–119. 5 indexed citations

18.

Dankelmann, Peter & Lutz Volkmann. (1997). Degree sequence conditions for maximally edge-connected graphs and digraphs. Journal of Graph Theory. 26(1). 27–34. 18 indexed citations

19.

Dankelmann, Peter & Lutz Volkmann. (1995). New sufficient conditions for equality of minimum degree and edge-connectivity.. Ars Combinatoria. 40. 270–278. 20 indexed citations

20.

Dankelmann, Peter. (1994). Average distance and independence number. Discrete Applied Mathematics. 51(1-2). 75–83. 51 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact