Some isomorphic properties of m-polar fuzzy graphs with applications

Abstract

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.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 52 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.