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

串联n—圈图的色多项式
引用本文:许进,李虹.串联n—圈图的色多项式[J].西北大学学报,1992,22(2):147-152.
作者姓名:许进  李虹
作者单位:陕西师范大学,西北大学
摘    要:

关 键 词:串联n-圈图  色多项式  递推公式

The Chromatic Polynomial of Connexion n-Cycle Graph
Xu Jin.The Chromatic Polynomial of Connexion n-Cycle Graph[J].Journal of Northwest University(Natural Science Edition),1992,22(2):147-152.
Authors:Xu Jin
Institution:Xu Jin (Shaanxi Normal University) Li Hong (Northwest University)
Abstract:In this paper, we obtain the recursive formula for calculating chromatic polynomial of connexion n-cycle graph. Also, We give calculating methods for chromatic polynomial of several sorts of graphs.
Keywords:Connexion n-cycle graph  Chromatic polynomial  Recursive formula  
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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