Chromatic equivalence class of the join of certain tripartite graphs
For a simple graph G, let P(G;λ) be the chromatic polynomial of G. Two graphs G and H are said to be chromatically equivalent, denoted G ~ H if P(G;λ) = P(H;λ). A graph G is said to be chromatically unique, if H ~ G implies that H ≅ G. Chia [4] determined the chromatic equivalence class of the graph...
Main Authors: | Lau, Gee Choon, Peng, Yee Hock |
---|---|
Format: | Article |
Language: | English |
Published: |
Universiti Putra Malaysia Press
2007
|
Online Access: | http://psasir.upm.edu.my/id/eprint/12562/1/page_103-108.pdf |
Similar Items
-
Chromatic Equivalence Classes and Chromatic Defining Numbers of Certain Graphs
by: Omoomi, Behnaz
Published: (2001) -
Chromatic equivalence classes of certain cycles with edges
by: Omoomi, Behnaz, et al.
Published: (2001) -
Chromatic uniqueness of turan graph with certain star deleted
by: Lau, Gee Choon, et al.
Published: (2009) -
Chromatic equivalence classes of certain generalized polygon trees, III
by: Omoomi, Behnaz, et al.
Published: (2003) -
Chromatic equivalence classes of certain generalized polygon trees
by: Peng, Yee Hock, et al.
Published: (1997)