Chromaticity of Complete 6-Partite Graphs with Certain Star or Matching Deleted Ⅱ

作     者：Roslan Hasni Ameen Shaman Ameen Yee-Hock Peng Hai-xing Zhao 

作者机构：School of Mathematical Sciences Universiti Sains Malaysia Department of Mathematics and Institute for Mathematical Research University Putra Malaysia Department of Mathematics Qinghai Normal University 

出 版 物：《Acta Mathematicae Applicatae Sinica》 (应用数学学报（英文版）)

年 卷 期：2013年第29卷第1期

页      面：35-42页

核心收录：

学科分类：07[理学] 08[工学] 070104[理学-应用数学] 0835[工学-软件工程] 0701[理学-数学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 081202[工学-计算机软件与理论] 

主　　题：chromatic polynomial chromatically closed chromatic uniqueness 

摘      要：Let P（G, λ） be the chromatic polynomial of a graph G. Two graphs G and H are said to be chromatically equivalent, denoted G N H, if P（G, λ） = P（H, λ）. We write [G] = {HIH - G}. If [G] = {G}, then G is said to be chromatically unique. In this paper, we first characterize certain complete 6-partite graphs with 6rid＋1 vertices according to the number of 7-independent partitions of G. Using these results, we investigate the chromaticity of G with certain star or matching deleted. As a by-product, many new families of chromatically unique complete 6-partite graphs with certain star or matching deleted are obtained.