Implementation of Graph Theory and Graph Coloring Using User Defined Simulation

Ajay Kaushik, Suruchi Gautam

Abstract


Graph coloring is a technique used widely in many applications. It is used to divide political areas using different colors. In the proposed paper we will build a used defined finite state machine, simulate the finite state machine. We will design different states of the finite state machine in form of graph. Vertices of the graph will represent different states of the finite state machine and edges of the graph will show the state transition from one state to another state. We will actually see the transition in states by means of changing colors in the graph representing finite state machine.

Keywords


Implementation; Graph Theory; Graph Coloring

Full Text:

PDF




Copyright (c) 2015 Ajay Kaushik, Suruchi Gautam

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

 

All published Articles are Open Access at  https://journals.pen2print.org/index.php/ijr/ 


Paper submission: ijr@pen2print.org