江西科学2001，Vol.19Issue(1)：5-7,3.
完全三部图K(m，n，r)的色唯一性的进一步结果
The Further Results of the Chromatic Uniqueness of Complete Tripartite Graphs K(m, n, r)
邹辉文 1朱忠华2
作者信息
- 1. 抚州师范专科学校数学与计算机系,
- 2. 东华大学基础部,
- 折叠
摘要
Abstract
Let G be a simple graph and P(G,λ) denote the chromatic polynomial of G.A graph G is said to be chromatically unique if for any graph H, P(H,λ) = P(G,λ) implies that H is isomorphic to G.Iet K(m,n,r) denote a complete tripartite graph,it is proved that K (m , n , r ) (if m ≤ n ≤ r , O ≤ r - m ≤ 3 and m≥2) are all chromatically unique.关键词
完全三部图/色唯一图/色划分引用本文复制引用
邹辉文,朱忠华..完全三部图K(m，n，r)的色唯一性的进一步结果[J].江西科学,2001,19(1):5-7,3.
