| 引用本文： |
-
韦新,邓天炎,罗海鹏,黎贞崇.几种特殊图的填充数[J].广西科学院学报,2007,23(4):217-219. [点击复制]
- WEI Xin,DENG Tian-yan,LUO Hai-peng,LI Zhen-chong.The Fill-in Number of Special Graphs[J].Journal of Guangxi Academy of Sciences,2007,23(4):217-219. [点击复制]
|
|
| 摘要: |
| 应用图的最优填充分解定理和局部最优填充定理,得到了书本图Bm、方型网图F(m;n)(m=1,2,3)和蛛网图W(m,n)(m=1;n=3)的填充数表达式分别为:F(Bm)=m,F(F(1;n))=n,F(F(2;n))=4n-3,F(F(3;n))=(3,n=1,9,n=2,14,n=3.)F(W(1,n))=n-3,F(W(m,3))=3(m-1)。 |
| 关键词: 填充 分解定理 图 |
| DOI： |
| 投稿时间：2007-09-20 |
| 基金项目:国家自然科学基金项目(60563008);广西自然科学基金项目(桂科自0728051)资助 |
|
| The Fill-in Number of Special Graphs |
|
WEI Xin1, DENG Tian-yan1, LUO Hai-peng2, LI Zhen-chong2
|
| (1.Department of Mathematics and Computer Science, Guangxi Teachers Education University, Nanning, Guangxi, 530001, China;2.Guangxi Academy of Sciences, Nanning, Guangxi, 530007, China) |
| Abstract: |
| By using the decomposition theorem and the local reductive elimination for the fill-in of graphs,we obtain the fill-in number of Books graph Bm,Mesh graph F(m;n)(m=1,2,3) and Cobweb-chart W(m,n)(m=1,n=3),F(Bm)=m,F(F(1;n))=n,F(F(2;n))=4n-3,F(F(3;n))=(3,n=1, 9,n=2, 14,n=3.) F(W(1,n))=n-3,F(W(m,3))=3(m-1). |
| Key words: fill-in decomposition theorem graph |
