首页 | 本学科首页   官方微博 | 高级检索  
     

关于Q-树偶次整子图色性的一族反例(英文)
引用本文:田方,刘象武. 关于Q-树偶次整子图色性的一族反例(英文)[J]. 应用数学, 2002, 0(Z1)
作者姓名:田方  刘象武
作者单位:[1]哈尔滨师范大学数学系 [2]哈尔滨师范大学数学系 哈尔滨
摘    要:Chao ,Li和Xu[1 ],韩伯棠 [2 ,3]和ThomasWanner[4 ]证明 ,以q 树 ,qk 树和q 树整子图的色多项式为色多项式的图是唯一的 ,即它们本身 .但本文 ,我们证明了q 树的偶次整子图的色多项式 ,除本身外 ,至少对应一类新图 ,而且指出这类图 ,即使色多项式仅有整根也不能三角化 .

关 键 词:q-树  q-树的r次整子图  k次加点q-树

A Class of Counter-Examples for the Even-Degree Integral Subgraphs of Q-Trees
TIAN Fang,LIU Xiang-wu. A Class of Counter-Examples for the Even-Degree Integral Subgraphs of Q-Trees[J]. Mathematica Applicata, 2002, 0(Z1)
Authors:TIAN Fang  LIU Xiang-wu
Abstract:Chao,Li and Xu,Han Botangand Thomas Wannerproved,the graphs determined by the chromatic polynomials of q-trees,q k-trees and the integral subgraphs of q-trees were unique,that was themselves.But in this paper,we show that the chromatic polynomial of the even-degree integral subgraphs of q-trees at least corresponds to,besides itself,another a new class of graphs.Furthemore,we point out this new class is not triangulated,though its chromatic polynomial only has integral roots.
Keywords:Q-Trees  R-Degree integral subgraph of q-trees  K-Degree added-vertex q-trees
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号