In this research paper, we present a novel frame work for handling $m$-polar information by combining the theory of $m-$polar fuzzy  sets with graphs. We introduce certain types of edge regular $m-$polar fuzzy graphs and edge irregular $m-$polar fuzzy graphs. We describe some useful properties of edge regular, strongly edge irregular and strongly edge totally irregular $m-$polar fuzzy graphs. W...

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...

In many real world problems, data sometimes comes from n agents (n≥2), multipolar information exists. For issues that are associated with uncertainty, this information can not be showed with the values of crisp, fuzzy, intuitionistic or bipolar. Graph is one of the mathematical models widely used in different sciences. Ambiguity in a graph where data depends on the n parameter can not be showed...

Integrity for crisp graph theory is a well-defined topic. However, the integrity concept fuzzy graphs has only recently been defined and extensively researched. in m-polar (mPFG), each node as well edges m components. So, defining mPF environment needs new concept. As environment, edge components, so we have more flexibility to address uncertainty rather than other uncertain environments. In th...

By combining the notions of interval-valued m-polar fuzzy graphs and graphs, notion cubic is first introduced. Then, degree a vertex in complete defined. After that, concepts direct product strong are given. Moreover, weak isomorphism co-weak defined, examples given to prove that not an isomorphism. Finally, complement presented.