Keyword Search:

Bookmark and Share

Chromaticity of Certain Bipartite Graphs

Hasni @ Abdullah, Roslan (2005) Chromaticity of Certain Bipartite Graphs. PhD thesis, Universiti Putra Malaysia.

[img] PDF


Since the introduction of the concepts of chromatically unique graphs and chromatically equivalent graphs, numerous families of such graphs have been obtained. The purpose of this thesis is to continue with the search of families of chromatically unique bipartite graphs. In Chapters 1 and 2, we define the concept of graph colouring, the associated chromatic polynomial and some properties of a chromatic polynomial. We also give some necessary conditions for graphs that are chromatically unique or chromatically equivalent. We end this chapter by stating some known results on the chromaticity of bipartite graphs, denoted as K(p,q).

Item Type:Thesis (PhD)
Subject:Bipartite graphs
Subject:Graph coloring
Chairman Supervisor:Associate Professor Peng Yee Hock, PhD
Call Number:FSAS 2005 2
Faculty or Institute:Faculty of Environmental Studies
ID Code:64
Deposited By: Siti Khairiah Yusof
Deposited On:30 Apr 2008 05:29
Last Modified:27 May 2013 14:45

Repository Staff Only: Edit item detail

Document Download Statistics

This item has been downloaded for since 30 Apr 2008 05:29.

View statistics for "Chromaticity of Certain Bipartite Graphs"