The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Peter Dankelmann: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sheng Bau, Michael A. Henning, Peter Dankelmann
    Average lower independence in trees and outerplanar graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:69, n:, pp:- [Journal]
  2. Gary Chartrand, Peter Dankelmann, Michelle Schultz, Henda C. Swart
    Twin Domination in Digraphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:67, n:, pp:- [Journal]
  3. Peter Dankelmann, Neil J. Calkin
    The Domatic Number of Regular Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2004, v:73, n:, pp:- [Journal]
  4. Peter Dankelmann, Ortrud R. Oellermann
    Degree Sequences of Optimally Edge-Connected Multigraphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2005, v:77, n:, pp:- [Journal]
  5. Peter Dankelmann, Lutz Volkmann
    Average distance in k-connected tournaments. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2005, v:77, n:, pp:- [Journal]
  6. Elias Dahlhaus, Peter Dankelmann, Wayne Goddard, Henda C. Swart
    MAD trees and distance-hereditary graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:1, pp:151-167 [Journal]
  7. Peter Dankelmann
    Average Distance and Independence Number. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:75-83 [Journal]
  8. Peter Dankelmann
    Average Distance and Domination Number. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:80, n:1, pp:21-35 [Journal]
  9. Peter Dankelmann, Wayne Goddard, Ortrud Oellermann, Henda C. Swart
    Augmenting trees so that every three vertices lie on a cycle. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:116, n:1-2, pp:145-159 [Journal]
  10. Peter Dankelmann, Ortrud Oellermann
    Bounds on the average connectivity of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:305-318 [Journal]
  11. Peter Dankelmann, Ortrud Oellermann, Jian-Liang Wu
    Minimum average distance of strong orientations of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:204-212 [Journal]
  12. Peter Dankelmann, Henda C. Swart, Ortrud Oellermann
    On the Average Steiner Distance of Graphs with Prescribed Properties. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:79, n:1-3, pp:91-103 [Journal]
  13. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:281, n:1-3, pp:137-148 [Journal]
  14. Peter Dankelmann, Renu C. Laskar
    Factor domination and minimum degree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:262, n:1-3, pp:113-119 [Journal]
  15. Peter Dankelmann, Dieter Rautenbach, Lutz Volkmann
    Weighted domination in triangle-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:250, n:1-3, pp:233-239 [Journal]
  16. Peter Dankelmann, Henda C. Swart, David P. Day
    On strong distances in oriented graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:266, n:1-3, pp:195-201 [Journal]
  17. Peter Dankelmann, Lutz Volkmann
    Degree sequence conditions for maximally edge-connected graphs depending on the clique number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:211, n:, pp:217-223 [Journal]
  18. Peter Dankelmann, Michael A. Henning, Wayne Goddard, Renu Laskar
    Simultaneous graph parameters: Factor domination and factor total domination. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:18, pp:2229-2233 [Journal]
  19. Peter Dankelmann
    Computing the Average Distance of an Interval Graph. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:48, n:6, pp:311-314 [Journal]
  20. Elias Dahlhaus, Peter Dankelmann, R. Ravi
    A linear-time algorithm to compute a MAD tree of an interval graph. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:89, n:5, pp:255-259 [Journal]
  21. Peter Dankelmann
    The diameter of directed graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2005, v:94, n:1, pp:183-186 [Journal]
  22. Peter Dankelmann, Wayne Goddard, Michael A. Henning, Henda C. Swart
    Generalized eccentricity, radius, and diameter in graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:34, n:4, pp:312-319 [Journal]
  23. Peter Dankelmann, Thomas Niessen, Ingo Schiermeyer
    On Path-Tough Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:4, pp:571-584 [Journal]
  24. Peter Dankelmann, Angelika Hellwig, Lutz Volkmann
    On the connectivity of diamond-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:16, pp:2111-2117 [Journal]

  25. Average distance in bipartite tournaments. [Citation Graph (, )][DBLP]


  26. On Complexity of Minimum Leaf Out-branching Problem [Citation Graph (, )][DBLP]


  27. Embedding graphs as isometric medians. [Citation Graph (, )][DBLP]


  28. On complexity of Minimum Leaf Out-Branching problem. [Citation Graph (, )][DBLP]


  29. On the degree distance of a graph. [Citation Graph (, )][DBLP]


  30. On equality in an upper bound for the restrained and total domination numbers of a graph. [Citation Graph (, )][DBLP]


  31. Diameter and inverse degree. [Citation Graph (, )][DBLP]


  32. Domination with exponential decay. [Citation Graph (, )][DBLP]


  33. Inverse degree and edge-connectivity. [Citation Graph (, )][DBLP]


  34. The edge-Wiener index of a graph. [Citation Graph (, )][DBLP]


  35. Average distance and generalised packing in graphs. [Citation Graph (, )][DBLP]


  36. Diameter of 4-colourable graphs. [Citation Graph (, )][DBLP]


Search in 0.030secs, Finished in 0.032secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002