Graph designs for all graphs with six vertices and eight edges are discussed. The existence of these graph designs are completely solved except in two possible cases of order 32.
In this paper, we discuss the G-decomposition of λKv （G-GD）, （v）） into five graphs with six vertices and eight edges. We present some recursive structures and a number of G-designs of small orders, holey G- desi...In this paper, we discuss the G-decomposition of λKv （G-GD）, （v）） into five graphs with six vertices and eight edges. We present some recursive structures and a number of G-designs of small orders, holey G- designs, and incomplete G-designs are constructed. Finally, the spectrum of the existence of G-GD）λ（v） is determined.展开更多
基金Supported by the Natural Science Foundation of China （No.10371031） and Natural Science Foundation of Hebei （No.103146）.
文摘Graph designs for all graphs with six vertices and eight edges are discussed. The existence of these graph designs are completely solved except in two possible cases of order 32.
基金Supported by National Natural Science Foundation of China Grant 10971051,11171089Natural Science Foundation of Hebei Province Grant A2010000353
文摘In this paper, we discuss the G-decomposition of λKv （G-GD）, （v）） into five graphs with six vertices and eight edges. We present some recursive structures and a number of G-designs of small orders, holey G- designs, and incomplete G-designs are constructed. Finally, the spectrum of the existence of G-GD）λ（v） is determined.
