Chromatic uniqueness of certain tripartite graphs identified with a path / G.C. Lau and Y.H. Peng

For a graph G, let P (G) be its chromatic polynomial. Two graphs G and H are chromatically equivalent if P(G) = P(H). A graph G is chromatically unique if P(H) = P(G) implies that H == G. In this paper, we classify the chromatic classes of graphs obtained from K2,2,2 u Pm (m ≥ 3) (respectively, (K2,...

Full description

Saved in:
Bibliographic Details
Main Authors: Lau, G.C., Peng, Y.H.
Format: Conference or Workshop Item
Language:English
Published: 2004
Subjects:
Online Access:https://ir.uitm.edu.my/id/eprint/50424/1/50424.PDF
https://ir.uitm.edu.my/id/eprint/50424/
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Universiti Teknologi Mara
Language: English
id my.uitm.ir.50424
record_format eprints
spelling my.uitm.ir.504242022-09-22T07:31:14Z https://ir.uitm.edu.my/id/eprint/50424/ Chromatic uniqueness of certain tripartite graphs identified with a path / G.C. Lau and Y.H. Peng Lau, G.C. Peng, Y.H. Algebra Sequences (Mathematics) Analysis For a graph G, let P (G) be its chromatic polynomial. Two graphs G and H are chromatically equivalent if P(G) = P(H). A graph G is chromatically unique if P(H) = P(G) implies that H == G. In this paper, we classify the chromatic classes of graphs obtained from K2,2,2 u Pm (m ≥ 3) (respectively, (K2,2,2 - e) u Pm (m ≥ 5) where e is an edge of K2,2,2) by identifying the end vertices of the path Pm with any two vertices of K2,2,2 (respectively, K2,2,2 - e). As a by-product of this; we obtained some families of chromatically unique and chromatically equivalent classes of graphs. 2004 Conference or Workshop Item PeerReviewed text en https://ir.uitm.edu.my/id/eprint/50424/1/50424.PDF Chromatic uniqueness of certain tripartite graphs identified with a path / G.C. Lau and Y.H. Peng. (2004) In: STSS 2004 : Sains Teknologi Jilid1, 31 Mei – 1 Jun 2004, Hotel Vistana, Kuantan, Pahang.
institution Universiti Teknologi Mara
building Tun Abdul Razak Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Mara
content_source UiTM Institutional Repository
url_provider http://ir.uitm.edu.my/
language English
topic Algebra
Sequences (Mathematics)
Analysis
spellingShingle Algebra
Sequences (Mathematics)
Analysis
Lau, G.C.
Peng, Y.H.
Chromatic uniqueness of certain tripartite graphs identified with a path / G.C. Lau and Y.H. Peng
description For a graph G, let P (G) be its chromatic polynomial. Two graphs G and H are chromatically equivalent if P(G) = P(H). A graph G is chromatically unique if P(H) = P(G) implies that H == G. In this paper, we classify the chromatic classes of graphs obtained from K2,2,2 u Pm (m ≥ 3) (respectively, (K2,2,2 - e) u Pm (m ≥ 5) where e is an edge of K2,2,2) by identifying the end vertices of the path Pm with any two vertices of K2,2,2 (respectively, K2,2,2 - e). As a by-product of this; we obtained some families of chromatically unique and chromatically equivalent classes of graphs.
format Conference or Workshop Item
author Lau, G.C.
Peng, Y.H.
author_facet Lau, G.C.
Peng, Y.H.
author_sort Lau, G.C.
title Chromatic uniqueness of certain tripartite graphs identified with a path / G.C. Lau and Y.H. Peng
title_short Chromatic uniqueness of certain tripartite graphs identified with a path / G.C. Lau and Y.H. Peng
title_full Chromatic uniqueness of certain tripartite graphs identified with a path / G.C. Lau and Y.H. Peng
title_fullStr Chromatic uniqueness of certain tripartite graphs identified with a path / G.C. Lau and Y.H. Peng
title_full_unstemmed Chromatic uniqueness of certain tripartite graphs identified with a path / G.C. Lau and Y.H. Peng
title_sort chromatic uniqueness of certain tripartite graphs identified with a path / g.c. lau and y.h. peng
publishDate 2004
url https://ir.uitm.edu.my/id/eprint/50424/1/50424.PDF
https://ir.uitm.edu.my/id/eprint/50424/
_version_ 1745565283214426112