Simple Search:

Two families of chromatically unique graphs.


Citation

Yee, Hock Peng (1992) Two families of chromatically unique graphs. In: The Asian Mathematical Conference, 14-18 August 1990, Hong Kong. .

Abstract / Synopsis

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.


Download File

[img] PDF
ID 18678.pdf
Restricted to Repository staff only

Download (249kB)

Additional Metadata

Item Type: Conference or Workshop Item (Paper)
Subject: Charts, diagrams, etc.
Subject: Mathematics.
Divisions: Faculty of Science
Keywords: Graph; Chromatic polynomial.
Depositing User: Samsida Samsudin
Date Deposited: 27 Nov 2013 16:31
Last Modified: 14 Apr 2014 14:54
URI: http://psasir.upm.edu.my/id/eprint/18678
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item