一个点并路的补图的色等价图类  

The Chromatic Equivalence Classes of the Complements of Union Graphs of Vertex and a Path

作　　者：李丹阳 马海成[1] LI Danyang;MA Haicheng(School of Mathematics and Statistics,Qinghai Nationalities University,Xining 810007,China)

机构地区：[1]青海民族大学数学与统计学院,西宁810007

出　　处：《西南大学学报（自然科学版）》2022年第4期110-116,共7页Journal of Southwest University(Natural Science Edition)

基　　金：国家自然科学基金项目(11561056,11661066);青海省自然科学基金项目(2022-ZJ-924);青海民族大学研究生创新项目(07M2021003).

摘　　要：设G是一个n阶图.众所周知,两个图G和H色等价当且仅当它们的补图伴随等价.可见伴随多项式是研究图的色多项式的一种有效途径.本文通过比较伴随多项式的最小根,最终计算了K_(1)∪P_(m)的伴随等价图的个数以及它的伴随等价图类.进一步,计算了K_(1)∪P_(m)的色等价图的个数以及它的色等价图类,这里K_(1)和P_(m)分别表示一个孤立点和m个点的路.Let G be a graph with order n.It is well known that two graphs G and H are chromatically equivalent if and only if their complementary graphs are adjoint equivalencet.It can be seen that adjoint polynomials are an effective way to study the chromatic polynomials of graphs.By comparing the minimum roots of adjoint polynomials,this paper finally calculates the number of adjoint equivalent graphs of K_(1)∪P_(m) and the class of adjoint equivalent graphs are also calculated.Furthermore,the number of chromatic equivalent graphs of K_(1)∪P_(m) and the class of chromatic equivalent graphs of K_(1)∪P_(m) are also calculated.Here,K_(1) and P_(m) represent an isolated vertex and a path of m vertices,respectively.

关 键 词：色多项式 伴随多项式 色等价 伴随等价 色唯一 伴随唯一 

分 类 号：O157.5[理学—数学]