Packing graphs in their complements

被引：2
|
作者：
Gangopadhyay, T [1 ]
机构：
[1] Inst Management & Labour Studies, XLRI, Jamshedpur 831001, Bihar, India
来源：
DISCRETE MATHEMATICS | 1998年 / 186卷 / 1-3期
关键词：
D O I：
10.1016/S0012-365X(97)00186-6
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
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.
引用
收藏
页码：117 / 124
页数：8
相关论文
共 50 条
12345