In many practical applications with a graph structure, there may exist crossing between edges which is not allowed in a crisp planar graph. Considering that graphic structures can be used to describe the crossing of edges in an m-polar fuzzy multi-graph with certain amount of m-polar fuzzy planarity value, first of all the notion of m-polar fuzzy multi-set is introduced. Then m-polar fuzzy multi-graphs, m-polar fuzzy planar graphs and m-polar fuzzy strong edges are defined. Several properties of m-polar fuzzy planar graphs are also studied.
Recently, Ghorai and Pal [ 12 ] introduced the notion of m -polar fuzzy planar graphs using the concept of m -polar fuzzy multisets. In this paper, m -polar fuzzy faces and strong m -polar fuzzy faces are defined. Then m -polar fuzzy dual graph of an m -polar fuzzy planar graph is introduced with example. Some isomorphism properties of m -polar fuzzy planar graphs are also studied.
The theory of graphs are very useful tool in solving the combinatorial problems in different areas of computer science and computational intelligence systems. In this paper, we present a frame work to handle m-polar fuzzy information by combining the theory of m-polar fuzzy sets with graphs. We introduce the notion of weak self complement m-polar fuzzy graphs and establish a necessary condition for m-polar fuzzy graph to be weak self complement. Some properties of self complement and weak self complement m-polar fuzzy graphs are discussed. The order, size, busy vertices and free vertices of an m-polar fuzzy graphs are also defined and proved that isomorphic m-polar fuzzy graphs have same order, size and degree. Also, we have presented some results of busy vertices in isomorphic and weak isomorphic m-polar fuzzy graphs. Finally, a relative study of complement and operations on m-polar fuzzy graphs have been made. Applications of m-polar fuzzy graph are also given at the end.