Thilagavathi, K. and Vernold Vivin, J. and Akbar Ali, M.M. (2009) On Harmonious Colouring of Central Graphs. Advances and Applications in Discrete Mathematics, 2, 17-33.

has been cited by the following article:

• TITLE: A Note on Acyclic Edge Colouring of Star Graph Families

  AUTHORS: P. Shanasbabu, A. V. Chithra

  KEYWORDS: Acyclic Edge Colouring, Acyclic Chromatic Index, Middle Graph, Central Graph, Total Graph, Line Graph

  JOURNAL NAME: American Journal of Computational Mathematics, Vol.5 No.3, August 26, 2015

  ABSTRACT: A proper edge colouring f of a graph G is called acyclic if there are no bichromatic cycles in the graph. The acyclic edge chromatic number or acyclic chromatic index, denoted by , is the minimum number of colours in an acyclic edge colouring of G. In this paper, we discuss the acyclic edge colouring of middle, central, total and line graphs of prime related star graph families. Also exact values of acyclic chromatic indices of such graphs are derived and some of their structural properties are discussed.