正则q-树根图的双概率可靠性探究  

On Reliability of Two Probability in Regular Q-Tree Rooted Graph

作　　者：刘念祖[1] 唐晓清[1] 王汉兴[1] 

机构地区：[1]上海立信会计学院,数学与信息学院,上海201620

出　　处：《西南师范大学学报（自然科学版）》2013年第12期24-27,共4页Journal of Southwest China Normal University(Natural Science Edition)

基　　金：国家自然科学基金资助项目(60872060);上海市教委科学基金资助项目(12ZZ193);上海市自然科学基金资助项目(12ZR1421000)

摘　　要：首先研究得到了双变量色多项式的一般性的减边公式.接着对根图顶点进行了期望值研究,得出其减边公式,并由此得到一些特殊根图的期望值计算公式.最后讨论了正则q-树根图和正则q-树整子根图的期望值计算公式.We have achieved a general Reduction Edge Formula.Then we have proposed a new vertex expect of rooted graphs,that is,we consider the expected number of vertices in the operational component of rooted graph which contains the root.And we get its Reduction edge formula.With this formula,we have obtained some specific graphsexpected value calculate formulas.Later,we have studied regular rooted qtree and integral subgraph of regular rooted q-tree.

关 键 词：色多项式 根图 减边公式 正则q-树根图 正则q-树整子根图 

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