Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《College Mathematics》 2018-01
Add to Favorite Get Latest Update

The Coloring Problem for Generalized Peterson Graph

ZHANG Gui-zhi;AN Yong-hong;AO Te-gen;College of Elementary Education,Hlunbuir College;College of Mathematics and Statistics,Hlunbuir College;Office of Science and Technology,Hlunbuir College;  
The chromatic polynomials of graphs are important parts of graph theory.In this paper,we discuss the coloring problem of Generalized Peterson graph under different constraints by means of generalized Pólya theorem and some algebraic methods.
【Fund】: 国家自然科学基金项目(11601137);; 内蒙古自治区高等学校“青年科技英才支持计划”(NJYT-17-B12);; 内蒙古自治区自然科学基金项目(2015BS0103 2016MS0114)
【CateGory Index】: O157.5
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved