Path of Half Intuitionistic Fuzzy Graph
YU Xianfeng
XING Xue
LI Chao
Abstract：Seen objects as vertex set, intuitionistic fuzzy number is used to depict the correlation and irrelevance between objects, which are defined as intuitionistic fuzzy edge.A half intuitionistic fuzzy graph model is built.The definations about path, and order relation of a half intuitionistic fuzzy graph are given.The limitative accessibility and gross accessibility of the path of a half intuitionistic fuzzy graph are defined.which are used to calculate the congestion situation of the path.The definition about strongest accessible path of a half intuitionistic fuzzy graph is introduced.The calculation algorithm of strongest accessible path is given.The algorithm can be used to calculate an optimum path when congestion is regarded as a main limiting factor.The rationality of the algorithm is proved and its complexity is analyzed.A example about calculating the strongest accessible path is given.The calculation result shows that the algorithm is reasonable and efficient and has a high degree of automation.
Keywords：half intuitionistic fuzzy graphpath accessibilitystrongest accessible path
Publication Date：2017-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：6( 299-303,310 )