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: | |
|---|---|
| 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!
|