Chromaticity of a family of 5-partite graphs

Let P(G,. λ) be the chromatic polynomial of a graph G. Two graphs G and H are said to be chromatically equivalent, denoted G~. H, if P(G,. λ). = P(H,. λ). We write [G]. = {H{divides}. H~. G}. If [G]. = {G}, then G is said to be chromatically unique. In this paper, we first characterize certain compl...

Full description

Bibliographic Details
Main Authors: Hasni, R. (Author), Lau, G.C (Author), Shaman, A. (Author)
Format: Article
Language:English
Published: University of Bahrain 2014
Subjects:
Online Access:View Fulltext in Publisher
View in Scopus

Similar Items