摘要
得到一类特殊双圈图的解析值和两种关于b(G)相等的图类。利用数学归纳法和分类讨论的方法,得到双圈图的紧的下界,证明了在所有阶为n的双圈图中,图△n*-6取得最小的a(G)和b(G),其中图△n*-6表示路Pn-6的两个端点各与一个k3相连所得双圈图。
The dissection for a kind of bicyclic grphs is obtained,the two kinds of bicyclic graphs,which have the same b(G),are given.By the principle of mathematical induction and classified discussion,the sharp down bound for dissection of bicyclic graphs with fixed order is obtained.Among all bicyclic graphs with order n,the graph△* n-6 has the minimum a(G)and b(G),where△* n-6 denotes the graph obtained from two K3 and Pn-6 by joining a vertex of each to each K3 endvertex of Pn-6.
出处
《商洛学院学报》
2011年第2期46-50,共5页
Journal of Shangluo University
基金
商洛学院科研基金项目(07SKY021)
关键词
图的解析
双圈图
界
dissection of graph
bicyclic graphs
bound