Back close
Admissions

Chromatic Partitioning of a Network and an Optimum Scheduling Problem

Publication Type : Journal Article

Publisher : IEEE

Source : Third International Conference on Advances in Electrical, Computing, Communication and Sustainable Technologies (ICAECT)

Url : https://ieeexplore.ieee.org/abstract/document/10117620

Campus : Amritapuri

School : School of Physical Sciences

Year : 2023

Abstract : This article aims to study the chromatic polynomial of some families of graphs and to describe the properties of the chromatic polynomial of some graph operations. In addition, we will explore results related to a chromatic polynomial of the subgraph of path graph obtained after fusing two vertices that are at a finite distance. Also, we give an idea of optimum scheduling based on different color classes in the graph.

Cite this Research Publication : Meera Sony, R Manjusha , Chromatic Partitioning of a Network and an Optimum Scheduling Problem, IEEE Xplore, 2023.

Admissions Apply Now