Hypergraphs in \(m\)-polar fuzzy environment (Q1657282)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Hypergraphs in \(m\)-polar fuzzy environment |
scientific article; zbMATH DE number 6916902
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hypergraphs in \(m\)-polar fuzzy environment |
scientific article; zbMATH DE number 6916902 |
Statements
Hypergraphs in \(m\)-polar fuzzy environment (English)
0 references
13 August 2018
0 references
Summary: 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 (\(m\)F, 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 \(m\)F sets to hypergraphs, and present the notions of regular \(m\)F hypergraphs and totally regular \(m\)F hypergraphs. We describe the certain properties of regular \(m\)F hypergraphs and totally regular \(m\)F hypergraphs. We discuss the novel applications of \(m\)F hypergraphs in decision-making problems. We also develop efficient algorithms to solve decision-making problems.
0 references
regular \(m\)F hypergraph
0 references
totally regular \(m\)F hypergraph
0 references
decision making
0 references
algorithm
0 references
time complexity
0 references