Chromatic Equivalence Classes and Chromatic Defining Numbers of Certain Graphs
There are two parts in this dissertation: the chromatic equivalence classes and the chromatic defining numbers of graphs. In the first part the chromaticity of the family of generalized polygon trees with intercourse number two, denoted by Cr (a, b; c, d), is studied. It is known that Cr( a, b;...
Saved in:
Main Author: | Omoomi, Behnaz |
---|---|
Format: | Thesis |
Language: | English English |
Published: |
2001
|
Subjects: | |
Online Access: | http://psasir.upm.edu.my/id/eprint/9335/1/FSAS_2001_57.pdf http://psasir.upm.edu.my/id/eprint/9335/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Chromatic equivalence class of the join of certain tripartite graphs
by: Lau, Gee Choon, et al.
Published: (2007) -
Chromatic equivalence classes of certain generalized polygon trees
by: Peng, Yee Hock, et al.
Published: (1997) -
Chromaticity of Certain Bipartite Graphs
by: Hasni @ Abdullah, Roslan
Published: (2005) -
Chromaticity of Certain 2-Connected Graphs
by: Lau, Gee Choon
Published: (2003) -
Chromatic equivalence classes of some families of complete
tripartite graphs
by: Chia, G. L., et al.
Published: (2014)