Volume : III, Issue : III, March - 2013

Acyclic Coloring of Helm Graph Families

R. Arundhadhi, Dr. K. Thirusangu

Abstract :

An acyclic coloring of a graph G is a proper vertex coloring (no two adjacent vertices of G have the same color) such that the induced subgraph of any two color classes is acyclic. The minimum number of colors needed to acyclically color the vertices of a graph G is called as acyclic chromatic number and is denoted by a(G). In this paper, we give the exact value of the acyclic chromatic number of Middle , Central and Total graph of Helm Graph families.

Keywords :

Article: Download PDF   DOI : 10.36106/ijar  

Cite This Article:

R. Arundhadhi,Dr. K. Thirusangu Acyclic Coloring of Helm Graph Families Indian Journal of Applied Research, Vol.III, Issue.III March 2013

Number of Downloads : 969

References :