Sciweavers

DM
2008
88views more  DM 2008»
13 years 11 months ago
Lower bounding the boundary of a graph in terms of its maximum or minimum degree
A vertex v of a graph G is a boundary vertex if there exists a vertex u such that the distance in G from u to v is at least the distance from u to any neighbour of v. We give the ...
Tobias Müller, Attila Pór, Jean-S&eacu...