The Equitable Chromatic Bounds on Splitting of Block Circulant Graphs

M Jagannathan, Vernold Vivin.J, Veninstine Vivik.J and Ganesh Ghorai

Mathematical Problems in Engineering, 2022, vol. 2022, 1-17

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.

Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/mpe/2022/7603023.pdf (application/pdf)
http://downloads.hindawi.com/journals/mpe/2022/7603023.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:7603023

DOI: 10.1155/2022/7603023

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().