Title of article
Spanning cubic graph designs
Author/Authors
Adams، نويسنده , , Peter and Ardal، نويسنده , , Hayri and Ma?uch، نويسنده , , J?n and H?a، نويسنده , , V? D?nh and Rosenfeld، نويسنده , , Moshe and Stacho، نويسنده , , Ladislav، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
8
From page
5781
To page
5788
Abstract
Graph designs are natural extensions of BIBDs (balanced incomplete block designs). In this paper we explore spanning cubic graph designs and develop tools for constructing some of them. We show that K 16 can be decomposed into each of the 4060 connected cubic graphs of order 16, and into precisely 144 of the 147 disconnected cubic graphs of order 16. We also identify some infinite families of cubic graphs of order 6 n + 4 that decompose K 6 n + 4 .
Keywords
Graph decomposition , block designs , Cubic graph , Complete Graph
Journal title
Discrete Mathematics
Serial Year
2009
Journal title
Discrete Mathematics
Record number
1599117
Link To Document