Fuzzy Graph Colouring on M-Polar Fuzzy Planar Graph and Complete Bipartite Graph with its Applications

View at publisher Summarise with VIRAT
Authors: K. Arun Prakash, A. Vijayalakshmi
Cited by: 0

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

This study explores the concept of fuzzy graph coloring within M-polar fuzzy planar and complete bipartite graphs, emphasizing its practical applications. The objective is to identify the fuzzy chromatic number - the least number of fuzzy colors needed to color a graph such that adjacent vertices have distinct colors. Incorporating fuzzy numbers through specialized cuts enables a more dynamic representation of graph structures. The relevance of fuzzy coloring extends to a variety of real-world scenarios, including optimizing network designs, scheduling systems, information retrieval, resource distribution, and decision-making processes under uncertain conditions. By analyzing the theoretical foundation and practical implications of fuzzy graph coloring, this research highlights its significance in complex system modeling.

Fields of Study & Subjects

Fuzzy and Soft Set Theory Graph Labeling and Dimension Problems Advanced Graph Theory Research

Publication details

Journal / source
CRC Press eBooks
Pages
380–385
Publication date
26 March 2026
Language
EN
Document type
Book chapter