Chromaticity of Certain Bipartite Graphs

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

[img] PDF
145Kb

Abstract

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:29 Apr 2008 21:29
Last Modified:27 May 2013 06:45

Repository Staff Only: item control page

Document Download Statistics

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

View statistics for "Chromaticity of Certain Bipartite Graphs"


Universiti Putra Malaysia Institutional Repository

Universiti Putra Malaysia Institutional Repository is an on-line digital archive that serves as a central collection and storage of scientific information and research at the Universiti Putra Malaysia.

Currently, the collections deposited in the IR consists of Master and PhD theses, Master and PhD Project Report, Journal Articles, Journal Bulletins, Conference Papers, UPM News, Newspaper Cuttings, Patents and Inaugural Lectures.

As the policy of the university does not permit users to view thesis in full text, access is only given to the first 24 pages only.