American Journal of Computational Mathematics

Volume 5, Issue 3 (September 2015)

ISSN Print: 2161-1203   ISSN Online: 2161-1211

Google-based Impact Factor: 1.05  Citations  

A Note on Acyclic Edge Colouring of Star Graph Families

HTML  XML Download Download as PDF (Size: 439KB)  PP. 253-257  
DOI: 10.4236/ajcm.2015.53022    4,009 Downloads   4,857 Views  Citations

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.

Share and Cite:

Shanasbabu, P. and Chithra, A. (2015) A Note on Acyclic Edge Colouring of Star Graph Families. American Journal of Computational Mathematics, 5, 253-257. doi: 10.4236/ajcm.2015.53022.

Cited by

[1] 系列平行图和 Meredith 图的无循环边着色
天津师范大学学报:自然科学版, 2018

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.