A new method to decision-making with fuzzy competition hypergraphs (Q2333771)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7129442
Language Label Description Also known as
default for all languages
No label defined
    English
    A new method to decision-making with fuzzy competition hypergraphs
    scientific article; zbMATH DE number 7129442

      Statements

      A new method to decision-making with fuzzy competition hypergraphs (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      13 November 2019
      0 references
      Summary: Hypergraph theory is the most developed tool for demonstrating various practical problems in different domains of science and technology. Sometimes, information in a network model is uncertain and vague in nature. In this paper, our main focus is to apply the powerful methodology of fuzziness to generalize the notion of competition hypergraphs and fuzzy competition graphs. We introduce various new concepts, including fuzzy column hypergraphs, fuzzy row hypergraphs, fuzzy competition hypergraphs, fuzzy \(k\)-competition hypergraphs and fuzzy neighbourhood hypergraphs, strong hyperedges, \(k\)th strength of competition and symmetric properties. We design certain algorithms for constructing different types of fuzzy competition hypergraphs. We also present applications of fuzzy competition hypergraphs in decision support systems, including predator-prey relations in ecological niche, social networks and business marketing.
      0 references
      fuzzy competition hypergraph
      0 references
      fuzzy \(k\)-competition hypergraph
      0 references
      fuzzy open neighbourhood
      0 references
      fuzzy closed neighbourhood
      0 references
      ecological niches
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references