Improved similarity measure in neutrosophic environment and its application in finding minimum spanning tree
From MaRDI portal
Publication:5275225
DOI10.3233/JIFS-152082zbMath1366.05056OpenAlexW2492295985MaRDI QIDQ5275225
Publication date: 11 July 2017
Published in: Journal of Intelligent & Fuzzy Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/jifs-152082
Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22) Fractional graph theory, fuzzy graph theory (05C72)
Cites Work
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- The relationship between similarity measure and entropy of intuitionistic fuzzy sets
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- Fuzzy entropy and conditioning
- Intuitionistic fuzzy sets
- Adaptive fuzzy tracking control for a class of uncertain nonaffine nonlinear systems with dead-zone inputs
- Models for inverse minimum spanning tree problem with fuzzy edge weights
- Spanning Trees and Optimization Problems
- A multicriteria decision-making method using aggregation operators for simplified neutrosophic sets
- Fuzzy entropy on intuitionistic fuzzy sets
- Fuzzy sets
- Entropy for intuitionistic fuzzy sets.