Peter Dankelmann
Impact in
- Geometry and Topology top 0.5%
- Graph theory and applications
- Computational Theory and Mathematics top 0.5%
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- Complexity and Algorithms in Graphs
- Computational Drug Discovery Methods
Papers in
-
- Advanced Graph Theory Research 83
- Graph Labeling and Dimension Problems 34
- Complexity and Algorithms in Graphs 10
-
- Graph theory and applications 61
- Co-authors
- Henda C. Swart (21 shared papers)Simon Mukwembi (15 shared papers)Lutz Volkmann (13 shared papers)Ortrud R. Oellermann (8 shared papers)Ivan Gutman (2 shared papers)Roger C. Entringer (1 shared paper)Angelika Hellwig (2 shared papers)David P. Day (3 shared papers)
- Journals
- Discrete Applied Mathematics (25 papers)Discrete Mathematics (24 papers)Journal of Graph Theory (12 papers)SIAM Journal on Discrete Mathematics (4 papers)Discrete Mathematics & Theoretical Computer Science (3 papers)
- Partner nations
- South AfricaGermanyUnited States
In The Last Decade
Peter Dankelmann
95 papers receiving 1.1k citations
Peers
Comparison fields: 5 of 63
- Geometry and Topology 756
- Computational Theory and Mathematics 947
- Discrete Mathematics and Combinatorics 156
- Computer Networks and Communications 376
- Computer Graphics and Computer-Aided Design 33
Countries citing papers authored by Peter Dankelmann
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
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-authors
The 25 scholars most cited alongside Peter Dankelmann, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 100 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2008 | 61 | |
| 2 | 2009 | 55 | |
| 3 | 1994 | 53 | |
| 4 | 2000 | 47 | |
| 5 | 2008 | 41 | |
| 6 | 1997 | 40 | |
| 7 | 2011 | 39 | |
| 8 | 1996 | 33 | |
| 9 | 2008 | 27 | |
| 10 | 2004 | 26 | |
| 11 | 1996 | 26 | |
| 12 | 2007 | 25 | |
| 13 | 1997 | 24 | |
| 14 | 2007 | 24 | |
| 15 | 2012 | 23 | |
| 16 | 2013 | 22 | |
| 17 | Twin Domination in Digraphs. | 2003 | 21 |
| 18 | New sufficient conditions for equality of minimum degree and edge-connectivity. | 1995 | 21 |
| 19 | 2004 | 21 | |
| 20 | 1993 | 20 |
About Peter Dankelmann
Peter Dankelmann is a scholar working on Computational Theory and Mathematics, Geometry and Topology, Discrete Mathematics and Combinatorics, Computer Networks and Communications and Computer Graphics and Computer-Aided Design, having authored 100 papers that have together received 1.2k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (83 papers), Graph theory and applications (61 papers), Interconnection Networks and Systems (38 papers), Graph Labeling and Dimension Problems (34 papers), Limits and Structures in Graph Theory (14 papers), graph theory and CDMA systems (13 papers), Complexity and Algorithms in Graphs (10 papers) and Synthesis and Properties of Aromatic Compounds (7 papers). The work is most often cited by research in Geometry and Topology (756 citations), Computational Theory and Mathematics (947 citations), Discrete Mathematics and Combinatorics (156 citations), Computer Networks and Communications (376 citations) and Computer Graphics and Computer-Aided Design (33 citations). Peter Dankelmann has collaborated with scholars based in South Africa, Germany and United States. Frequent co-authors include Henda C. Swart, Simon Mukwembi, Lutz Volkmann, Ortrud R. Oellermann, Ivan Gutman, Roger C. Entringer, Angelika Hellwig, David P. Day, Michael A. Henning and Johannes H. Hattingh. Their work appears in journals such as Discrete Applied Mathematics, Discrete Mathematics, Journal of Graph Theory, SIAM Journal on Discrete Mathematics and Discrete Mathematics & Theoretical Computer Science.
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.