An Application of Graph Vertex Coloring

Authors

  • S. Srividhya Department of Mathematics, Sathyabama Institute of Science and Technology (Deemed to be University), Chennai- 600 119, India.

DOI:

https://doi.org/10.9734/bpi/rumcs/v3/2699G

Keywords:

G - graph, X- Group of workers, w – workers, points – vertices, links – edges, A(G) – adjacency matrix, i – rows of a matrix, j – columns of a matrix, chromatic number - the least number of colors required to do a coloring of a graph

Abstract

Graph coloring has many applications including task scheduling, parallel computation, frequency allocation, Network design, register allocation etc.  Here we concerned about the problem of vertex coloring on scheduling or assigning where these graph coloring provide algorithm to prevent or at least minimize the conflict scheduling. The objective is to provide simple way for solving worker scheduling problem in big industries. To overcome these problems we can schedule the task for workers by applying the concept of vertex coloring of graph theory using GRIN software.

Downloads

Published

2024-04-03

How to Cite

S. Srividhya. (2024). An Application of Graph Vertex Coloring. Research Updates in Mathematics and Computer Science Vol. 3, 70–79. https://doi.org/10.9734/bpi/rumcs/v3/2699G

Issue

Research Updates in Mathematics and Computer Science Vol. 3

Section

Chapters