International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 42 - Number 18 |
Year of Publication: 2012 |
Authors: R. Arundhadhi, R. Sattanathan |
10.5120/5795-8131 |
R. Arundhadhi, R. Sattanathan . Acyclic Coloring on Double Star Graph Families. International Journal of Computer Applications. 42, 18 ( March 2012), 32-35. DOI=10.5120/5795-8131
The purpose of this study is to find the acyclic chromatic number for central graph, middle graph, total graph and line graph of Double star graph K1,n,n , denoted by C( K1,n,n ), M(K1,n,n ), T(K1,n,n ) and L(K1,n,n ) respectively. Vernold vivin (et. al. ,2011) [ 9 ], have proved that the star chromatic number and equitable chromatic number of these graphs are same. We discuss the relationship between the acyclic and star chromatic number of these graphs.