Types of fuzzy graph colouring and polynomial ideal theory Online publication date: Mon, 05-Sep-2022
by Arindam Dey; Anita Pal
International Journal of Advanced Intelligence Paradigms (IJAIP), Vol. 23, No. 1/2, 2022
Abstract: The graph colouring problem (GCP) is one of the most important optimisation problems in graph theory. In real life scenarios, many applications of graph colouring are fuzzy in nature. Fuzzy set and fuzzy graph can manage the uncertainty, associated with the information of a problem, where conventional mathematical models/graph may fail to reveal satisfactory result. To include those fuzzy properties in solving those types of problems, we have extended the various types of classical graph colouring methods to fuzzy graph colouring methods. In this study, we describe three basic types of fuzzy graph colouring methods namely, fuzzy vertex colouring, fuzzy edge colouring and fuzzy total colouring. We introduce a method to colour the vertices of the fuzzy graph using the polynomial ideal theory and find the fuzzy vertex chromatic number of the fuzzy graph. A practical example of scheduling committees meeting is given to demonstrate our proposed algorithm.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Advanced Intelligence Paradigms (IJAIP):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook