Application of Strong Arcs in m-Polar Fuzzy Graphs

摘要

Recently, m-polar fuzzy graph (mPF graph) becomes a growing research topic as the generalization of fuzzy graph. In this paper, at first mPF path, mPF cycle in an mPF graph are defined. The strength of connectedness of mPF path is introduced. Next, strongest and strong mPF path, mPF bridges, mPF cut nodes, mPF tree and mPF forests in an mPF graph are considered. Also, it is proved that an arc of mPF tree is strong mPF arc if and only if it is an mPF bridge. Finally, mPF end nodes in an mPF graph is defined and investigated some properties of it. An application of strongest path problem in 3-polar fuzzy graph is also given at the end.