中间图的pebbling数  

Pebbling number of middle graphs

作　　者：刘海英[1] 秦琼[1] 王志平[1] 马永刚[1] 

机构地区：[1]大连海事大学数学系,辽宁大连116026

出　　处：《大连海事大学学报》2006年第4期125-128,共4页Journal of Dalian Maritime University

基　　金：中国博士后基金资助项目(2004036391)

摘　　要：证明路、完全图和星图三种特殊图中间图的pebbling数问题.根据生成子图的性质得到路的中间图的pebbling数为2n+n-2;利用数学归纳法得到完全图的中间图的pebbling数为[n(n+1)]/2;根据Chung的定理11提出引理1,并利用引理1得到星图中间图的pebbling数为3n+3.In this paper, we proved the pebbling numbers of the middle graphs of specific graphs such as paths,complete graphs and star graphs. According to the properties of spanning sub-graphs, the pebbling number of the middle graphs of paths is 2^n ＋ n -2; Using the principle of mathematical induction, the pebbling number of the middle graphs of complete graphs is [ n （ n ＋ 1 ） ]/2 ; Using Chung＇ s fact 11, we provide lemma 1 and use it to prove that the pebbling number of the middle graphs of star graphs is 3 n ＋ 3.

关 键 词：图论 PEBBLING 中间图 数学归纳法 

分 类 号：O157.5[理学—数学]