关于q-树二次整子图和n阶加点q-树色多项式的注记  

A Note on Two-degree Integral Subgraph of q-Tree and Added-vertex q-Tree on n Vertices with Their Chromatic Polynomials

作　　者：刘颖[1] 曾伟梁[1] 刘焕平[1] 

机构地区：[1]哈尔滨师范大学数学学院,哈尔滨150025

出　　处：《应用数学学报》2010年第1期78-87,共10页Acta Mathematicae Applicatae Sinica

基　　金：哈尔滨师范大学青年学术骨干资助计划项目(KGB200809)

摘　　要：在这篇文章中我们成功地仅用色多项式表征了最小度不等于q-3的q-树的二次整子图和n阶加点q-树,即当图的最小度δ(G)≠q-3时,n阶图G具有色多项式P(G;λ)=λ(λ-1)…(λ-q+2)(λ-q+1)~3(λ-q)^(n-q-2),n≥q+2,当且仅当G是n阶q-树的二次整子图或n阶加点q-树.In this paper we have successfully characterized two-degree integral subgraph of q-tree and added-vertex q-tree on n vertices by chromatic polynomials only that if the minimum degree of graph G does not equal q-3（δ（G）≠q-3）,then the graphs with the chromatic polynomial as following P（G;λ） =λ（λ-1）…（λ-q ＋ 2）λ-q＋13（λ-q）n-q-2,n≥q＋2, could only be two-degree integral subgraph of q-tree or added-vertex q-tree on n vertices.

关 键 词：q-树的二次整子图 二色子图 n阶加点q-树 

分 类 号：O212.7[理学—概率论与数理统计]