Research Article
Dominator Coloring of Central Graphs
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 51 - Issue 12 |
| Published: August 2012 |
| Authors: K. Kavitha, N. G. David |
10.5120/8093-1673
|
K. Kavitha, N. G. David . Dominator Coloring of Central Graphs. International Journal of Computer Applications. 51, 12 (August 2012), 11-14. DOI=10.5120/8093-1673
@article{ 10.5120/8093-1673,
author = { K. Kavitha,N. G. David },
title = { Dominator Coloring of Central Graphs },
journal = { International Journal of Computer Applications },
year = { 2012 },
volume = { 51 },
number = { 12 },
pages = { 11-14 },
doi = { 10.5120/8093-1673 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2012
%A K. Kavitha
%A N. G. David
%T Dominator Coloring of Central Graphs%T
%J International Journal of Computer Applications
%V 51
%N 12
%P 11-14
%R 10.5120/8093-1673
%I Foundation of Computer Science (FCS), NY, USA
Abstract
Dominator chromatic number of central graph of various graph families such as cycles, paths, wheel graphs, complete graphs and complete bipartite graphs are 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