Fuzzy graphs in the evaluation and optimization of networks (Q1198856): Difference between revisions

A fuzzy vertex graph \(G=(V,E)\) is a set of vertices \(V\) and edges \(E\) such that associated with each vertex in \(V\) is a fuzzy membership degree \(u\), \(0\leq u\leq 1\), and each edge between two vertices \(v_ 1\) and \(v_ 2\) has the fuzzy membership degree \(u(v_ 1)\ast u(v_ 2)\). The author uses fuzzy vertex graphs to establish the membership degree \(M\) of the existence of fuzzy rooted trees. Properties of the structure of the fuzzy trees are determined so that \(M\) is maximum. The results are useful for modeling hierarchical systems.