Packing graphs in their complements

In this paper we prove that if m self-packing graphs are attached one each to any m points of a self-packing graph, then the resultant graph is also self-packing. From this we deduce that if every block of a graph G is either a K-2 or a C-n With n greater than or equal to 5, then G is self-packing, provided G is not a star. We also show that if every block of a graph G is self-packing then G also is self-packing. (C) 1998 Published by Elsevier Science B.V. All rights reserved.