Research Article
Dominator Chromatic Number of Middle and Total Graphs
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 49 - Issue 20 |
| Published: July 2012 |
| Authors: K. Kavitha, N. G. David |
10.5120/7891-1287
|
K. Kavitha, N. G. David . Dominator Chromatic Number of Middle and Total Graphs. International Journal of Computer Applications. 49, 20 (July 2012), 42-46. DOI=10.5120/7891-1287
@article{ 10.5120/7891-1287,
author = { K. Kavitha,N. G. David },
title = { Dominator Chromatic Number of Middle and Total Graphs },
journal = { International Journal of Computer Applications },
year = { 2012 },
volume = { 49 },
number = { 20 },
pages = { 42-46 },
doi = { 10.5120/7891-1287 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2012
%A K. Kavitha
%A N. G. David
%T Dominator Chromatic Number of Middle and Total Graphs%T
%J International Journal of Computer Applications
%V 49
%N 20
%P 42-46
%R 10.5120/7891-1287
%I Foundation of Computer Science (FCS), NY, USA
Abstract
Dominator chromatic number of middle and total graphs of various graph families is found in this paper. Also these parameters are compared with dominator chromatic number of their respective graph families.
References
- J. A. Bondy and U. S. R. Murty, Graph theory with Applications, London: MacMillan (1976).
- R. M. Gera, On Dominator Colorings in Graphs, Graph Theory Notes of New York LIT, 25-30 (2007)
- F. Harary, Graph Theory, Narosa Publishing 1969.
- D. Michalak, On Middle and Total graphs with Coarseness Number Equal 1, Lecture Notes in Mathematics, Volume 1018: Graph Theory, Springer-Verlag, Berlin, 139 – 150 (1983).
Index Terms
Keywords