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:
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 語言: | English English |
| 出版: |
2001
|
| 主題: | |
| 在線閱讀: | http://psasir.upm.edu.my/id/eprint/9335/1/FSAS_2001_57.pdf http://psasir.upm.edu.my/id/eprint/9335/ |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|