Characterization of a Vertex Colouring of a Double Layered Complete Fuzzy Graph Using ? – CUT

Abstract

In this paper we defined a new fuzzy graph named Double layered complete fuzzy graph. (DLCFG). The double layered complete fuzzy graph gives a 3-D structure. Further we introduced vertex colouring of the double layered complete fuzzy graph using ?-cut.

Introduction

I. INTRODUCTION

 Fuzzy graph theory was introduced by Azriel Rosenfeld in 1975.Graph theory is proved to be useful in modelling the essential features of systems with finite components. Graph theory plays a major role in colouring of various graphs. If the relation among accounts is to be measured as good or bad according to the frequency of contacts among the accounts, fuzziness should be added to representation. This and many another problem motivated to define fuzzy graphs Rosenfeld first introduced the concept of fuzzy graph. Fuzzy graph is a part of our life of graph theory which is involved in colouring, fuzzy logic, and some features of graphical concepts. After that fuzzy graph theory becomes a vast researched area. A fuzzy set is defined mathematically by assigning to each possible individual in the universe of discourse a value, representing its grade of membership, which corresponds to the degree, to which that individual is similar or compatible with the concept represented by the fuzzy set. Fuzzy graphs have many more applications in modelling real time systems where the level of information inherent in the systems varies with different level of precision. In this paper ,The notion of fuzzy set which is characterized by a membership function which assigns to each object a grade of membership which ranges from 0 to 1. The fuzzy colouring problem consists of determining the chromatic number of a fuzzy graph and an associated colouring function. For any level Alpha, the minimum number of colours needed to colour the crisp graph G α will be computed. In this way the fuzzy chromatic number is defined as fuzzy number through it’s α– cuts.

Conclusion

In this paper we have briefly discussed about the vertex colouring of the double layered complete fuzzy graph using alpha cut. We conclude that the chromatic number is decrease when the value of alpha cut is increase. This concept will help not only in vertex colouring also in edge colouring of DLCFG using alpha cut. Also we have found a double layered complete fuzzy graph, and theoretical concepts based on double layered fuzzy graph and proved double layered fuzzy graph as strong fuzzy graph and illustrated with some examples and have given a relation between complete fuzzy graph and a double layered complete fuzzy graph. Further structures can be developed by increasing number of cycles. This structural pattern with the cycles gives further information into different patterns in networking models.

References

[1] “Vertex colouring of double layered complete fuzzy graph using ? – cut”, International Journal of Mechanical Engineering ISSN: 0974-5823 Vol.7 No.4 (April, 2022). [2] “ Colouring in various graphs”, Jaya priya.B, and Kamali.R, GEDRAG & ORGANISATIE REVIEW - ISSN:0921-5077 VOLUME 34 : ISSUE 03 - 2021 http://lemma-tijdschriften.com/ [3] “A study on vertex colouring”, N. Malini, and R. Subramani, Advances and Applications in Mathematical Sciences Volume 21, Issue 3, January 2022, Mili Publications, India. [4] Arindam Dey, Anita Pal, Vertex Colouring Of Fuzzy Graph Using ?- Cut, IJMIE, Volume 2 Issue 8, August 2012. [5] “Applications of Edge colouring of fuzzy graphs”, Rupkumar Mahapatra, Sovan Samanta, and Madhumangal Pala. Article in Informatica · January 2020 DOI: 10.15388/20-INFOR403. https://www.researchgate.net/publication/340383318 [6] J.JonArockiaraj and V.Chandrasekaran, “Double layered complete Fuzzy Graph (DLCFG)”. Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 13, Number 9 (2017), pp. 6633-6646 © Research India Publications http://www.ripublication.com [7] Arindam Dey, Anita Pal, Vertex Colouring Of Fuzzy Graph Using ?- Cut, IJMIE, Volume 2 Issue 8, August 2012.

Copyright

Copyright © 2022 Kaviyaa. V , Manikandan. M. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.