%A TANG Jie-quan, SHU Jin-long
%T Fill-in Numbers of Some Graphs
%0 Journal Article
%D 2006
%J Journal of East China Normal University(Natural Science)
%R
%P 76-82
%V 2006
%N 5
%U {https://xblk.ecnu.edu.cn/CN/abstract/article_24792.shtml}
%8 2006-09-25
%X By using the decomposition theorem and the local reductive elimination for the fill-in of graphs, the fill-in numbers of some special graphs, such as G_{1}×G_{2}, S(G) and double cyclic graphs were studied. And the following results were obtained: (1)F(P_{m}×P_{n})≦(m-2)(n-2), where m≧2, n≧2; ; (2) if G is a 2-connected graph with m edges and n vertices, then F(S(G))=m+F(G); (3) let G be a double cyclic graph, the length of the two cycles being p and q, respectively, and t the number of the vertices which are both in the two cycles (the end points are excluded), then F(G)=p+q-t-6.