Chromaticity Of Bipartite Graphs With Three And Four Edges Deleted

Yeang , Hoong Phoy (2007) Chromaticity Of Bipartite Graphs With Three And Four Edges Deleted. Masters thesis, USM.

[img]
Preview
PDF
Download (567kB) | Preview

Abstract

Graphs are a set of vertices and edges. All vertices may or may not be joint. Vertex coloring is the coloring of a graph with a fixed number of colors such that adjacent vertices are of different colors. Graf adalah satu set titik dengan satu set garisan yang menghubungkan titik-titik. Semua titik mungkin dihubungkan dengan garisan.

Item Type: Thesis (Masters)
Subjects: Q Science > QA Mathematics > QA1 Mathematics (General)
Divisions: Pusat Pengajian Sains Matematik (School of Mathematical Sciences)
Depositing User: Mr Firdaus Mohamad
Date Deposited: 08 Dec 2015 08:03
Last Modified: 08 Dec 2015 08:03
URI: http://eprints.usm.my/id/eprint/29571

Actions (login required)

View Item View Item
Share