IJPAM: Volume 81, No. 2 (2012)
Faculty of Science and Technology
University Malaysia Terengganu
21030, Kuala Terengganu, Terengganu, MALAYSIA
Universiti Sains Malaysia
11800, USM Penang, MALAYSIA
Abstract. For a graph
, let
denote the chromatic polynomial of
. Two graphs
and
are chromatically equivalent (or simply
equivalent), denoted by
, if
. A graph
is chromatically unique (or simply
unique) if for any graph
such as
, we have
, i.e,
is isomorphic to
. A
-homeomorph is a subdivision of the complete graph
. In this paper, we discuss a pair of chromatically equivalent of
-homeomorphs with girth 9, that is,
and
. As a result, we obtain two infinite chromatically equivalent non-isomorphic
-homeomorphs.
Received: July 6, 2012
AMS Subject Classification: 05C15
Key Words and Phrases: chromatic polynomial, chromatic equivalence,
-homeomorphs
Download paper from here.
Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Year: 2012
Volume: 81
Issue: 2

