Decomposition of λKv into Five Graphs with Six Vertices and Eight Edges

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...

Full description

Saved in:
Bibliographic Details
Published inActa Mathematicae Applicatae Sinica Vol. 28; no. 4; pp. 823 - 832
Main Authors Yuan, Lan-dang, Kang, Qing-de
Format Journal Article
LanguageEnglish
Published Heildeberg Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society 2012
Subjects
Applications of Mathematics
G-设计
Math Applications in Computer Science
Mathematical and Computational Physics
Mathematics
Mathematics and Statistics
Theoretical
分解
和数
递归结构
顶点
graph design
holey graph design
quasi-group
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:11-2041/O1
graph design, holey graph design, quasi-group
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.
ISSN:0168-9673
1618-3932
DOI:10.1007/s10255-012-0191-1