摘要
研究了2类6点7边图的最大填充与最小覆盖.运用"差方法"、"带洞图设计"等工具,结合一系列小设计的构作,证明了存在(v,Gi,λ)-OPD(OCD)当且仅当v≡2,3,4,5,6(mod 7),λ≥1,i=1,2.
A maximum (v, G, λ )-PD and a minimum (v, G, λ )-CD are studied for 2 graphs of 6 vertices and 7 edges. By means of different method and holey graph design, The existence of a ( v, Gi,λ )-OPD (OCD) when and only when v≡2,3,4,5,6(mod 7),λ≥1,i=1,2. is proved.
出处
《河北师范大学学报(自然科学版)》
CAS
北大核心
2009年第5期561-566,共6页
Journal of Hebei Normal University:Natural Science
基金
NSFCGrant基金(10671055)