Simple Search:

Chromaticity of Certain Bipartite Graphs


Citation

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

Abstract / Synopsis

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).


Download File

[img]
Preview
PDF
1000548936_fsas_2005_2.pdf

Download (149kB)

Additional Metadata

Item Type: Thesis (PhD)
Subject: Bipartite graphs
Subject: Graph coloring
Call Number: FSAS 2005 2
Chairman Supervisor: Associate Professor Peng Yee Hock, PhD
Divisions: Faculty of Environmental Studies
Depositing User: Siti Khairiah Yusof
Date Deposited: 29 Apr 2008 21:29
Last Modified: 27 May 2013 06:45
URI: http://psasir.upm.edu.my/id/eprint/64
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item