应用图的最优填充分解定理和局部最优填充定理,得到了书本图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,F(W(1,n))=n-3,F(W(m,3))=3(m-1). 14,n=3.
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,F(W(1,n))=n-3,F(W(m,3))=3(m-1). 14,n=3.