Fuzzy end nodes in fuzzy graphs
暂无分享,去创建一个
We define a fuzzy end node in a fuzzy graph, and show that no node can be both a cut node and a fuzzy end node. In a fuzzy tree, every node is either a cut node or a fuzzy end node, but the converse is not true. We also show that any nontrivial fuzzy tree has at least two fuzzy end nodes, and we characterize fuzzy cycles that have no cut nodes or no fuzzy end nodes.
[1] Ambat Vijayakumar,et al. A Characterization of Fuzzy Trees , 1999, Inf. Sci..
[2] John N. Mordeson,et al. Fuzzy Graphs and Fuzzy Hypergraphs , 2000, Studies in Fuzziness and Soft Computing.
[3] T. Pavlidis,et al. Fuzzy sets and their applications to cognitive and decision processes , 1977 .