Abstract
An equitable vertex coloring for the splitting of block circulant graphs is investigated. The block circulant graphs comprises block circulant matrices, where each block is itself a matrix. These blocks in each row are cyclically shifted one place to the right from those of the previous row. We approached such block circulant graphs in matrix representation and derived their independent sets using the neighbourhoods of each vertex. This classification makes the vertex coloring process to be simpler and equitable in most cases. In this framework, the equitable chromatic numbers are obtained for splitting on block circulant graphs, namely prism, antiprism, crossed and closed sun graphs.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
