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.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
