Abstract
Fuzzy graphs have many more applications in modelling real time systems where the level of information inherent in the system varies with different levels of precision. Colouring of graphs is a most important concept in which we partition the vertex (edge) set of any associated graph so that adjacent vertices (edges) belong to different sets of the partition. In this paper we introduce k-Fuzzy total colouring of a wheel graph.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
