Minimal and Maximal e=1 Functions (2008)
P. Dankelmann, D. J. Erwin, G. Fricke, W. Goddard, H. C. Swart
Dedicated to Ernie Cockayne, friend and colleague Abstract. An e = 1 function is a function f: V (G) ↦ → [0, 1] such that every non-isolated vertex u is adjacent to some vertex v such that f(u) +...
MAD trees and distance-hereditary graphs (2008)
E. Dahlhaus, P. Dankelmann, W. Goddard
For a graph G with weight function w on the vertices, the total distance of G is the sum over all unordered pairs of vertices x and y of w(x)w(y) times the distance between x and y. A MAD tree of G...