A Note on Acyclic Edge Colouring of Star Graph Families  

作　　者：P. Shanasbabu A. V. Chithra 

机构地区：[1]Department of Mathematics, National Institute of Technology, Calicut, India

出　　处：《American Journal of Computational Mathematics》2015年第3期253-257,共5页美国计算数学期刊（英文）

摘　　要：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.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.

关 键 词：ACYCLIC Edge COLOURING ACYCLIC CHROMATIC Index MIDDLE GRAPH Central GRAPH Total GRAPH Line GRAPH 

分 类 号：O1[理学—数学]