Chromaticity of bipartite graphs with three and four edges deleted

Simple item page
dc.contributor.authorHoong Phoy, Yeang
dc.date.accessioned2015-07-30T06:13:41Z
dc.date.available2015-07-30T06:13:41Z
dc.date.issued2007
dc.description.abstractGraphs 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. Considering all the possible ways of coloring a certain graph G with A colors will result in a polynomial in A. This polynomial is the chromatic polynomial of the graph G denoted by P (G; A). Two members from a set of graphs may have the same chromatic polynomial. These are called chromatically equivalent graphs. If a member of a set of graphs has a chromatic polynomial which is different from every other member in the set then this graph is chromatically unique. Bipartite graphs are graphs in which the vertices are partitioned into two non intersecting sets with condition that no vertices within the sets are adjacent. A complete bipartite graph is a bipartite graph with all the vertices in each set being adjacent to all the vertices of the other set. This project studies the chromaticity of complete bipartite graphs with three and also four edges deleted.en_US
dc.identifier.urihttp://hdl.handle.net/123456789/1066
dc.language.isoenen_US
dc.subjectBipartite graphsen_US
dc.subjectFour edges deleteden_US
dc.titleChromaticity of bipartite graphs with three and four edges deleteden_US
dc.typeThesisen_US
Files
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Pusat Pengajian Sains Matematik - Tesis