Search

The tolerance graph is a well-defined topic for a crisp graph theory. But, tolerance in a fuzzy graph is defined recently and many properties have been investigated. But, in a fuzzy graph, only one tolerance is considered for every vertex. But, in an m-polar fuzzy graph (mPFG), each vertex and edge has a m number of membership values. So, defining tolerance for mPFG is not easy and needs some new ideas. By considering m tolerances for every component out of m components of membership values of a vertex or edge, we defined m-polar fuzzy tolerance graph (mPFTG). Here, m-polar fuzzy convex set (mPFCS) as well as strongly mPFCS are also studied. Some different types of mPFTGs like m-polar fuzzy min-tolerance graph, m-polar fuzzy max-tolerance graph, m-polar fuzzy sum-tolerance graph are also introduced. Some related terms like bounded mPFTG, m-polar fuzzy interval containment graph, m-polar fuzzy unit tolerance graph (mPF unit TG) are also defined. Here, m-polar fuzzy intersection graph along with tolerance core as well as tolerance support length are also discussed. Some interesting properties on m-polar fuzzy min-tolerance graph, m-polar fuzzy max-tolerance graph, m-polar fuzzy sum-tolerance graph are also investigated. Lastly, a real-life application based on an assigned work done by a private company has been discussed to show its practicability in mPFTG.

The threshold graph is a well studied topic. But, the fuzzy threshold graph is defined recently and investigated many properties. In a fuzzy threshold graph, only one threshold is considered for every vertex and edge. In a m-polar fuzzy graph, each vertex and each edge has a m number of membership values. So, defining a threshold graph for m-polar fuzzy graph is not easy and needs some new ideas. By considering m thresholds each for each component out of m components of membership values of a vertex or edge, we defined m-polar fuzzy threshold graph (mPFTG). Many interesting properties are also presented on mPFTG. The mPFTG is also decomposed in a very unique way and this decomposition generates m different fuzzy threshold graphs and the properties of decomposed graphs are explained. The important parameters viz. m-polar fuzzy threshold dimension and mPF threshold partition number are also defined and investigated thoroughly. Finally, a real-life application using mPFTG on a resource power controlling system is presented.

In this article, a new idea of interval-valued m-polar fuzzy (IVmPF) graph is introduced and investigated some of it’s properties. Here, IVmPF multiset, interval-valued m-polar fuzzy (IVmPF) multi graph are presented. IVmPF planar value of an interval-valued m-polar fuzzy (IVmPF) planar graph along with degree of planarity value is also introduced to measure the planarity value of an interval-valued m-polar fuzzy (IVmPF) graph. Some related terms like complete IVmPF graph, strong IVmPF graph, strong edges, faces of IVmPF planar graph are presented. In this paper, IVmPF dual graph is also described which is closely related to IVmPF planar graph. Some important properties are studied on IVmPF dual graph. Lastly, a real life application on IVmPF planar graph has been discussed to show its practicability.

In this article, a new idea of fuzzy fractional coloring of fuzzy graph is presented and fuzzy fractional chromatic number is defined. A relationship between fuzzy fractional chromatic number and fuzzy fractional clique number is established. Some properties of fuzzy chromatic number of fuzzy graphs and fuzzy fractional chromatic number of fuzzy graphs are proved and the concept of k-strong adjacent vertices is introduced. Fuzzy chromatic number and fuzzy fractional chromatic number have been calculated on lexicographic product of two fuzzy graphs. Also, fuzzy chromatic number, independence number and fuzzy fractional chromatic number have been investigated on disjoint union of two fuzzy graphs. Lastly, a real life application of fuzzy fractional coloring on fuzzy graph is discussed.

The saturation graph is a well-defined topic. But, saturation in a fuzzy graph was de ned recently and investigated many properties. In a fuzzy saturation graph, only one saturation is considered for every vertex. In a m-polar fuzzy graph (mPFG), each vertex and edge has a m number of membership values. So, defining saturation for mPFG is not easy and needs some new ideas. By considering m saturation for each component out of m components of membership values of a vertex, we defined saturation in mPFG. α-saturation as well as β-saturation in mPFG is introduced here. Many interesting properties of it are also presented. α-vertex count and β-vertex count in mPFG are also studied and the upper bound on some well known mPFG is also found here. Finally, a real-life application using saturation in mPFG is also presented.