摘要
图的着色问题是图论的重要研究内容之一,利用广义的Pólya定理和结合一些代数方法研究了广义Peterson图在不同约束条件下的着色问题,并给出了四种不同约束条件下的色多项式.
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.
引文
[1]Chris G,Gordon R.Algebraic Graph Theory[M].New York:Springer-Verlag,2001:112-126.
[2]Bondy J A,Murty U S R.Graph Theory with Applications[M].London:The Macmillan,Press Ltd,1976:56-66.
[3]Du Q Y.Pòlya′s Formula and Chromatic Oribt Polynomials[J].Nei Mongolia Da Xue Xue Bao,2000,31(16):551-561.
[4]Biggs N L.Algebraic graph theory[M].2nd ed.Cambridge:Cambridge University Press,1993:47-48.
[5]强会英,晁福刚,等.关于扇和完全等二部图联图的点可区别边染色[J].大学数学,2009,25(4):49-55.
[6]郝自军,张玉栋,张忠辅.关于扇和完全等二部图联图的均匀全色数[J].大学数学,2009,25(1):35-39.