THE CHROMATIC UNIQUENESS OF A FAMILY OF 6-BRIDGE GRAPHS

被引：0
|
作者：
Khalaf, A. M. [1 ,2 ]
Peng, Y. H. [1 ]
机构：
[1] Univ Putra Malaysia, Fac Sci, Dept Math, Serdang 43400, Malaysia
[2] Univ Kufa, Coll Math & Comp Sci, Dept Math, Najaf, Iraq
来源：
AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS | 2009年 / 6卷 / 03期
关键词：
Chromatic polynomials; chromaticity; 6-bridge graphs;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Let P(G, gimel) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically equivalent, written G similar to H, if P(G, gimel) = P(H, gimel). A graph G is chromatically unique, written x-unique, if for any graph H, G similar to H implies that G is isomorphic with H. In this paper we prove the chromatic uniqueness of a new family of 6-bridge graphs.
引用
收藏
页码：393 / 400
页数：8
相关论文
共 50 条
12345