It appears you don't have support to open PDFs in this web browser. To view this file, Open with your PDF reader
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.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer
Details
1 RESEARCH SCHOLAR (full time internal) Reg No: 18113162092059, Sree Ayyapacollege for women, Chunkankadai; Afflated to ManonmaniamSundaranar University,Abishekapatti,Tirunelveli-627012,Tamil Nadu,India.
2 Assistant professor, Department of Mathematics, SreeAyyapacollege for women Chunkankadai.; Afflated to ManonmaniamSundaranar University,Abishekapatti,Tirunelveli-627012,Tamil Nadu,India.