Path: Top -> Journal -> Jurnal Internasional -> Fuzzy Information and Engineering -> 2019 -> Volume 11, Issue 4

Unify Steiner Weiner Distance for Some Class of m-Polar Fuzzy Graphs

Journal from gdlhub / 2021-08-26 16:52:51
Oleh : Asefeh Karbasioun & Reza Ameri, Fuzzy Information and Engineering
Dibuat : 2021-08-26, dengan 0 file

Keyword : Fuzzy graph, Steiner Weiner index, Cartesian product, composition, join of m-polar fuzzy graphs
Url : http://www.tandfonline.com/doi/full/10.1080/16168658.2020.1747161
Sumber pengambilan dokumen : Web

Sometimes information in a network model is based on multi-agent, multi-attribute, multi-object, multi-polar information or uncertainty rather than a single bit. An m-polar fuzzy model is useful for such network models which gives more and more precision, flexibility, and comparability to the system as compared to the classical, fuzzy models. On the other, The Steiner tree problem in networks, and particularly in graphs, was formulated by Hakimi [25] and Levi [21] by definition minimal size connected tree sub graph that contains the vertices in S. Steiner trees have applications to multiprocessor computer networks. For example, it may be desired to connect a certain set of processors with a sub network that uses the fewest communication links. In this paper, we extend Steiner distance SWk(G) for m-polar fuzzy graphs and give this parameter for Join, composition and Cartesian product of two m-polar fuzzy graphs.

Deskripsi Alternatif :

Sometimes information in a network model is based on multi-agent, multi-attribute, multi-object, multi-polar information or uncertainty rather than a single bit. An m-polar fuzzy model is useful for such network models which gives more and more precision, flexibility, and comparability to the system as compared to the classical, fuzzy models. On the other, The Steiner tree problem in networks, and particularly in graphs, was formulated by Hakimi [25] and Levi [21] by definition minimal size connected tree sub graph that contains the vertices in S. Steiner trees have applications to multiprocessor computer networks. For example, it may be desired to connect a certain set of processors with a sub network that uses the fewest communication links. In this paper, we extend Steiner distance SWk(G) for m-polar fuzzy graphs and give this parameter for Join, composition and Cartesian product of two m-polar fuzzy graphs.

Beri Komentar ?#(0) | Bookmark

PropertiNilai Properti
ID Publishergdlhub
OrganisasiFuzzy Information and Engineering
Nama KontakHerti Yani, S.Kom
AlamatJln. Jenderal Sudirman
KotaJambi
DaerahJambi
NegaraIndonesia
Telepon0741-35095
Fax0741-35093
E-mail Administratorelibrarystikom@gmail.com
E-mail CKOelibrarystikom@gmail.com

Print ...

Kontributor...

  • Editor: Calvin