Some Properties of Chromatic, Domination, and Independence Numbers of a Graph | ||
| Albahir journal | ||
| Article 1, Volume 3, Issue 5, December 2016, Pages 27-33 | ||
| Authors | ||
| and Ahmed Abd Ali Imran; Manal Najy Al-harere | ||
| Abstract | ||
| Consider G(E,V) be a finite, undirected and simple connected graph. This paper includes study of some properties that illustrate the relations between three numbers in a graph which are chromatic, domination, and independence with special restrictions. Finally, we compute these parameters in a new graph namely K4 -isosceles triangular graph. | ||
| Keywords | ||
| Chromatic number; Domination number; Independence number; and; isosceles triangular graph | ||
|
Statistics Article View: 179 PDF Download: 13 |
||