The centroidal branches of a separable g
โ
Robert Molina
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 660 KB
If T is a tree, then the weight of a vertex v in T is the number of vertices in a largest component of T -v. The centroid of a tree is the set of vertices of minimum weight. We show that if G is a separable graph then there is a unique block or cutvertex that contains the centroids of all spanning t