Acyclic coloring of wheel graph families
Author:
R. Arundhadhi1 and R. Sattanathan2
Affiliation:
1Researcher Scholar, Bharathiar University, Coimbatore India
2Associate Professor & Head Deptt. of Mathematics, D.G. Vaishnav College, Arunbakkam Chennai India
Keyword:
Middle graph, central graph, total graph, acyclic coloring, acyclic chromatic numbe
Issue Date:
December 2011
Abstract:
In this paper, we discuss the acyclic vertex coloring and acyclic chromatic number of middle graph, central graph and total graph of wheel graph.
General terms : Middle graph, central graph, total graph of wheel graph Wn are denoted by M(Wn), C(Wn) and T (Wn) respectively.
Pages:
709-716
ISSN:
2319-8044 (Online) - 2231-346X (Print)
Source:
PDF:
DOI:
jusps-A
Share This:
Copy the following to cite this article:
R. Arundhadhi1 and R. Sattanathan2 , "Acyclic coloring of wheel graph families", Journal of Ultra Scientist of Physical Sciences, Volume 23, Issue 3, Page Number 709-716, 2016Copy the following to cite this URL:
R. Arundhadhi1 and R. Sattanathan2 , "Acyclic coloring of wheel graph families", Journal of Ultra Scientist of Physical Sciences, Volume 23, Issue 3, Page Number 709-716, 2016Available from: https://www.ultrascientist.org/paper/733/
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License
