Some Properties of Fuzzy Evidence Graph

Abstract

A fuzzy evidence graph is a non-empty set V= P(X)\ ? and E ={(A,B): A? B , A,B? V } together with a pair of functions m : V?[0,1] and ? : E ?[0,1] such that ?(A,B) =m(A) ? m(B) . Also ?_(A?V)??m(A)?=1.In this paper we introduce some properties of fuzzy evidence graph, a special type of fuzzy digraph, including isomorphism and a subgraph of fuzzy evidence graph called Hasse subgraph.