A Note on Acyclic Edge Colouring of Star Graph Families
A Note on Acyclic Edge Colouring of Star Graph Families作者机构：Department of Mathematics National Institute of Technology Calicut India
出 版 物：《American Journal of Computational Mathematics》 (美国计算数学期刊（英文）)
年 卷 期：2015年第5卷第3期
页 面：253-257页
学科分类：07[理学] 0701[理学-数学] 070101[理学-基础数学]
主 题：Acyclic Edge Colouring Acyclic Chromatic Index Middle Graph Central Graph Total Graph Line Graph
摘 要：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.
维普期刊数据库