Cover Image

Two families of chromatically unique graphs.

Let P(G) denote the chromatic polynomial of a graph G. A graph G is said to be chromatically unique if P(G) = P(H) implies that H is isomorphic to G. In this paper, We prove that a graph (resp., a bipartite graph) obtained from K2,4 U P3 (s ≥ 3) (resp., K3,3 U P3 (s ≥ 7)) by identifying the end...

Full description

Saved in:
Bibliographic Details
Main Author: Yee, Hock Peng
Format: Conference or Workshop Item
Language:English
English
Published: 1992
Online Access:http://psasir.upm.edu.my/id/eprint/18678/1/ID%2018678.pdf
http://psasir.upm.edu.my/id/eprint/18678/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.upm.eprints.18678
record_format eprints
spelling my.upm.eprints.186782014-04-14T06:54:12Z http://psasir.upm.edu.my/id/eprint/18678/ Two families of chromatically unique graphs. Yee, Hock Peng Let P(G) denote the chromatic polynomial of a graph G. A graph G is said to be chromatically unique if P(G) = P(H) implies that H is isomorphic to G. In this paper, We prove that a graph (resp., a bipartite graph) obtained from K2,4 U P3 (s ≥ 3) (resp., K3,3 U P3 (s ≥ 7)) by identifying the end vertices of the path Ps with any two vertices of the complete bipartite graph K2,4 (resp., K3,3) is chromatically unique. 1992 Conference or Workshop Item NonPeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/18678/1/ID%2018678.pdf Yee, Hock Peng (1992) Two families of chromatically unique graphs. In: The Asian Mathematical Conference, 14-18 August 1990, Hong Kong. . English
institution Universiti Putra Malaysia
building UPM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Putra Malaysia
content_source UPM Institutional Repository
url_provider http://psasir.upm.edu.my/
language English
English
description Let P(G) denote the chromatic polynomial of a graph G. A graph G is said to be chromatically unique if P(G) = P(H) implies that H is isomorphic to G. In this paper, We prove that a graph (resp., a bipartite graph) obtained from K2,4 U P3 (s ≥ 3) (resp., K3,3 U P3 (s ≥ 7)) by identifying the end vertices of the path Ps with any two vertices of the complete bipartite graph K2,4 (resp., K3,3) is chromatically unique.
format Conference or Workshop Item
author Yee, Hock Peng
spellingShingle Yee, Hock Peng
Two families of chromatically unique graphs.
author_facet Yee, Hock Peng
author_sort Yee, Hock Peng
title Two families of chromatically unique graphs.
title_short Two families of chromatically unique graphs.
title_full Two families of chromatically unique graphs.
title_fullStr Two families of chromatically unique graphs.
title_full_unstemmed Two families of chromatically unique graphs.
title_sort two families of chromatically unique graphs.
publishDate 1992
url http://psasir.upm.edu.my/id/eprint/18678/1/ID%2018678.pdf
http://psasir.upm.edu.my/id/eprint/18678/
_version_ 1643826863516155904
score 13.159267

Similar Items