Hypergraphs in m-Polar Fuzzy Environment
Fuzzy graph theory is a conceptual framework to study and analyze the units that are intensely or frequently connected in a network. It is used to study the mathematical structures of pairwise relations among objects. An m-polar fuzzy (mF, for short) set is a useful notion in practice, which is used...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2018-02-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | http://www.mdpi.com/2227-7390/6/2/28 |
id |
doaj-e67054582a154afa8189d8e3320d1db5 |
---|---|
record_format |
Article |
spelling |
doaj-e67054582a154afa8189d8e3320d1db52020-11-24T20:46:40ZengMDPI AGMathematics2227-73902018-02-01622810.3390/math6020028math6020028Hypergraphs in m-Polar Fuzzy EnvironmentMuhammad Akram0Gulfam Shahzadi1Department of Mathematics, University of the Punjab, New Campus, Lahore 54590, PakistanDepartment of Mathematics, University of the Punjab, New Campus, Lahore 54590, PakistanFuzzy graph theory is a conceptual framework to study and analyze the units that are intensely or frequently connected in a network. It is used to study the mathematical structures of pairwise relations among objects. An m-polar fuzzy (mF, for short) set is a useful notion in practice, which is used by researchers or modelings on real world problems that sometimes involve multi-agents, multi-attributes, multi-objects, multi-indexes and multi-polar information. In this paper, we apply the concept of mF sets to hypergraphs, and present the notions of regular mF hypergraphs and totally regular mF hypergraphs. We describe the certain properties of regular mF hypergraphs and totally regular mF hypergraphs. We discuss the novel applications of mF hypergraphs in decision-making problems. We also develop efficient algorithms to solve decision-making problems.http://www.mdpi.com/2227-7390/6/2/28regular mF hypergraphtotally regular mF hypergraphdecision-makingalgorithmtime complexity |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Muhammad Akram Gulfam Shahzadi |
spellingShingle |
Muhammad Akram Gulfam Shahzadi Hypergraphs in m-Polar Fuzzy Environment Mathematics regular mF hypergraph totally regular mF hypergraph decision-making algorithm time complexity |
author_facet |
Muhammad Akram Gulfam Shahzadi |
author_sort |
Muhammad Akram |
title |
Hypergraphs in m-Polar Fuzzy Environment |
title_short |
Hypergraphs in m-Polar Fuzzy Environment |
title_full |
Hypergraphs in m-Polar Fuzzy Environment |
title_fullStr |
Hypergraphs in m-Polar Fuzzy Environment |
title_full_unstemmed |
Hypergraphs in m-Polar Fuzzy Environment |
title_sort |
hypergraphs in m-polar fuzzy environment |
publisher |
MDPI AG |
series |
Mathematics |
issn |
2227-7390 |
publishDate |
2018-02-01 |
description |
Fuzzy graph theory is a conceptual framework to study and analyze the units that are intensely or frequently connected in a network. It is used to study the mathematical structures of pairwise relations among objects. An m-polar fuzzy (mF, for short) set is a useful notion in practice, which is used by researchers or modelings on real world problems that sometimes involve multi-agents, multi-attributes, multi-objects, multi-indexes and multi-polar information. In this paper, we apply the concept of mF sets to hypergraphs, and present the notions of regular mF hypergraphs and totally regular mF hypergraphs. We describe the certain properties of regular mF hypergraphs and totally regular mF hypergraphs. We discuss the novel applications of mF hypergraphs in decision-making problems. We also develop efficient algorithms to solve decision-making problems. |
topic |
regular mF hypergraph totally regular mF hypergraph decision-making algorithm time complexity |
url |
http://www.mdpi.com/2227-7390/6/2/28 |
work_keys_str_mv |
AT muhammadakram hypergraphsinmpolarfuzzyenvironment AT gulfamshahzadi hypergraphsinmpolarfuzzyenvironment |
_version_ |
1716811847852621824 |