Fuzzy graphs in the evaluation and optimization of networks (Q1198856): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 03:30, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Fuzzy graphs in the evaluation and optimization of networks |
scientific article |
Statements
Fuzzy graphs in the evaluation and optimization of networks (English)
0 references
16 January 1993
0 references
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.
0 references
optimization of networks
0 references
fuzzy vertex graph
0 references
fuzzy membership degree
0 references
fuzzy rooted trees
0 references