两类含四长圈的八点图的图设计  

Graph Design with Eight Vertices

作　　者：王建永[1] 

机构地区：[1]河南大学数学与信息科学学院,河南开封475001

出　　处：《淮北煤炭师范学院学报（自然科学版）》2008年第2期5-8,共4页Journal of Huaibei Coal Industry Teachers College(Natural Science edition)

基　　金：河南大学科研基金资助项目(06YBZR0050)

摘　　要：设λKv为完全多重图,G为有限简单图,图设计G-GDλ(v)是一个序偶(X,B),其中,X是Kv的顶点集,区组集B为λKv的一种分拆,B是与G同构的子图,利用"差方法"、"带洞图设计"等工具,结合小阶数的设计,对两类八点八边图的图设计进行讨论,并确定了对任意λ的存在谱.Let λKv be a complete multiple graph with v vertices, and G be a finite simple graph. Graph design G-GDλ（v） is a pair of （X, ）,where X is the vertex set of Kv and is a partition of all the edges in AKv, such that each member of is isomorphic to G. By means of “diference method” and “holey graph design”, graph design for a graph G with eight vertices and eight edges is discussed, and the existence spectrum for the G- GDλ（v） of λKv is determined.

关 键 词：图设计 带洞图设计 不完全图设计 

分 类 号：O157[理学—数学]