| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Peter Dankelmann |
Average distance in weighted graphs.  |
Discrete Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, David Erwin, Simon Mukwembi, B. G. Rodrigues, Eric Mwambene, Gert Sabidussi |
Automorphism group and diameter of a graph. |
Journal of Graph Theory |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, Henda C. Swart, Paul van den Berg |
The number of edges in a bipartite graph of given radius. |
Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank Bullock, Peter Dankelmann, Marietjie Frick, Michael A. Henning, Ortrud R. Oellermann, Susan A. van Aardt |
Hamiltonicity of k-Traceable Graphs. |
Electr. J. Comb. |
2011 |
DBLP BibTeX RDF |
|
| 1 | Peter Dankelmann |
On the distance distribution of trees. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Aleksandar Ilic, Dragan Stevanovic, Lihua Feng, Guihai Yu, Peter Dankelmann |
Degree distance of unicyclic and bicyclic graphs. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann |
Average distance and generalised packing in graphs. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, Lutz Volkmann |
The Diameter of Almost Eulerian Digraphs. |
Electr. J. Comb. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Peter Dankelmann, Lutz Volkmann |
Minimum size of a graph or digraph of given radius. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, Angelika Hellwig, Lutz Volkmann |
Inverse degree and edge-connectivity. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, I. Gutman, Simon Mukwembi, Henda C. Swart |
The edge-Wiener index of a graph. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, David P. Day, David Erwin, Simon Mukwembi, Henda C. Swart |
Domination with exponential decay. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Éva Czabarka, Peter Dankelmann, László A. Székely |
Diameter of 4-colourable graphs. |
Eur. J. Comb. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, Simon Mukwembi, Henda C. Swart |
Average distance and vertex-connectivity. |
Journal of Graph Theory |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, I. Gutman, Simon Mukwembi, Henda C. Swart |
On the degree distance of a graph. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, Gregory Gutin, Eun Jung Kim |
On complexity of Minimum Leaf Out-Branching problem. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, Henda C. Swart, Paul van den Berg |
Diameter and inverse degree. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, Gregory Gutin, Eun Jung Kim |
On Complexity of Minimum Leaf Out-branching Problem |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Peter Dankelmann, Simon Mukwembi, Henda C. Swart |
Average Distance and Edge-Connectivity II. |
SIAM J. Discrete Math. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, Simon Mukwembi, Henda C. Swart |
Average Distance and Edge-Connectivity I. |
SIAM J. Discrete Math. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, Gert Sabidussi |
Embedding graphs as isometric medians. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, David P. Day, Johannes H. Hattingh, Michael A. Henning, Lisa R. Markus, Henda C. Swart |
On equality in an upper bound for the restrained and total domination numbers of a graph. |
Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, Angelika Hellwig, Lutz Volkmann |
On the connectivity of diamond-free graphs. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, Lutz Volkmann |
Average distance in bipartite tournaments. |
Ars Comb. |
2007 |
DBLP BibTeX RDF |
|
| 1 | Peter Dankelmann, Michael A. Henning, Wayne Goddard, Renu Laskar |
Simultaneous graph parameters: Factor domination and factor total domination. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann |
The diameter of directed graphs. |
J. Comb. Theory, Ser. B |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, Lutz Volkmann |
Average distance in k-connected tournaments. |
Ars Comb. |
2005 |
DBLP BibTeX RDF |
|
| 1 | Peter Dankelmann, Ortrud R. Oellermann |
Degree Sequences of Optimally Edge-Connected Multigraphs. |
Ars Comb. |
2005 |
DBLP BibTeX RDF |
|
| 1 | Elias Dahlhaus, Peter Dankelmann, R. Ravi |
A linear-time algorithm to compute a MAD tree of an interval graph. |
Inf. Process. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, Gayla S. Domke, Wayne Goddard, Paul J. P. Grobler, Johannes H. Hattingh, Henda C. Swart |
Maximum sizes of graphs with given domination parameters. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, Ortrud Oellermann, Jian-Liang Wu |
Minimum average distance of strong orientations of graphs. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, Neil J. Calkin |
The Domatic Number of Regular Graphs. |
Ars Comb. |
2004 |
DBLP BibTeX RDF |
|
| 1 | Peter Dankelmann, Henda C. Swart, David P. Day |
On strong distances in oriented graphs. |
Discrete Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, Renu C. Laskar |
Factor domination and minimum degree. |
Discrete Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Elias Dahlhaus, Peter Dankelmann, Wayne Goddard, Henda C. Swart |
MAD trees and distance-hereditary graphs. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, Ortrud Oellermann |
Bounds on the average connectivity of a graph. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Gary Chartrand, Peter Dankelmann, Michelle Schultz, Henda C. Swart |
Twin Domination in Digraphs. |
Ars Comb. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Sheng Bau, Michael A. Henning, Peter Dankelmann |
Average lower independence in trees and outerplanar graphs. |
Ars Comb. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Peter Dankelmann, Dieter Rautenbach, Lutz Volkmann |
Weighted domination in triangle-free graphs. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, Wayne Goddard, Ortrud Oellermann, Henda C. Swart |
Augmenting trees so that every three vertices lie on a cycle. |
Discrete Applied Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, Dieter Rautenbach, Lutz Volkmann |
Some results on graph parameters in weighted graphs. |
Electronic Notes in Discrete Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, Lutz Volkmann |
Degree sequence conditions for maximally edge-connected graphs depending on the clique number. |
Discrete Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, Wayne Goddard, Michael A. Henning, Henda C. Swart |
Generalized eccentricity, radius, and diameter in graphs. |
Networks |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, Henda C. Swart, Ortrud Oellermann |
On the Average Steiner Distance of Graphs with Prescribed Properties. |
Discrete Applied Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann |
Average Distance and Domination Number. |
Discrete Applied Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, Thomas Niessen, Ingo Schiermeyer |
On Path-Tough Graphs. |
SIAM J. Discrete Math. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann |
Average Distance and Independence Number. |
Discrete Applied Mathematics |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann |
Computing the Average Distance of an Interval Graph. |
Inf. Process. Lett. |
1993 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")