Vše

Co hledáte?

Vše
Projekty
Výsledky výzkumu
Subjekty

Rychlé hledání

  • Projekty podpořené TA ČR
  • Významné projekty
  • Projekty s nejvyšší státní podporou
  • Aktuálně běžící projekty

Chytré vyhledávání

  • Takto najdu konkrétní +slovo
  • Takto z výsledků -slovo zcela vynechám
  • “Takto můžu najít celou frázi”

A Study on Optimizing the Maximal Product in Cubic Fuzzy Graphs for Multifaceted Applications

Identifikátory výsledku

  • Kód výsledku v IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27230%2F24%3A10254941" target="_blank" >RIV/61989100:27230/24:10254941 - isvavai.cz</a>

  • Výsledek na webu

    <a href="https://www.webofscience.com/wos/woscc/full-record/WOS:001231638100001" target="_blank" >https://www.webofscience.com/wos/woscc/full-record/WOS:001231638100001</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.3390/math12101605" target="_blank" >10.3390/math12101605</a>

Alternativní jazyky

  • Jazyk výsledku

    angličtina

  • Název v původním jazyce

    A Study on Optimizing the Maximal Product in Cubic Fuzzy Graphs for Multifaceted Applications

  • Popis výsledku v původním jazyce

    Graphs in the field of science and technology make considerable use of theoretical concepts. When dealing with numerous links and circumstances in which there are varying degrees of ambiguity or robustness in the connections between aspects, rather than purely binary interactions, cubic fuzzy graphs (CFGs) are more adaptable and compatible than fuzzy graphs. To better represent the complexity of interactions or linkages in the real world, an emerging CFG can be very helpful in achieving better problem-solving abilities that specialize in domains like network analysis, the social sciences, information retrieval, and decision support systems. This idea can be used for a variety of uncertainty-related issues and assist decision-makers in selecting the best course of action through the use of a CFG. Enhancing the maximized network of three cubic fuzzy graphs&apos; decision-making efficiency was the ultimate objective of this study. We introduced the maximal product of three cubic fuzzy graphs to investigate how interval-valued fuzzy membership, fuzzy membership, and the miscellany of relations are all simultaneously supported through the aspect of degree and total degree of a vertex. Furthermore, the domination on the maximal product of three CFGs was illustrated to analyze the minimum domination number of the weighted CFG, and the proposed approach is illustrated with applications.

  • Název v anglickém jazyce

    A Study on Optimizing the Maximal Product in Cubic Fuzzy Graphs for Multifaceted Applications

  • Popis výsledku anglicky

    Graphs in the field of science and technology make considerable use of theoretical concepts. When dealing with numerous links and circumstances in which there are varying degrees of ambiguity or robustness in the connections between aspects, rather than purely binary interactions, cubic fuzzy graphs (CFGs) are more adaptable and compatible than fuzzy graphs. To better represent the complexity of interactions or linkages in the real world, an emerging CFG can be very helpful in achieving better problem-solving abilities that specialize in domains like network analysis, the social sciences, information retrieval, and decision support systems. This idea can be used for a variety of uncertainty-related issues and assist decision-makers in selecting the best course of action through the use of a CFG. Enhancing the maximized network of three cubic fuzzy graphs&apos; decision-making efficiency was the ultimate objective of this study. We introduced the maximal product of three cubic fuzzy graphs to investigate how interval-valued fuzzy membership, fuzzy membership, and the miscellany of relations are all simultaneously supported through the aspect of degree and total degree of a vertex. Furthermore, the domination on the maximal product of three CFGs was illustrated to analyze the minimum domination number of the weighted CFG, and the proposed approach is illustrated with applications.

Klasifikace

  • Druh

    J<sub>imp</sub> - Článek v periodiku v databázi Web of Science

  • CEP obor

  • OECD FORD obor

    20300 - Mechanical engineering

Návaznosti výsledku

  • Projekt

  • Návaznosti

    S - Specificky vyzkum na vysokych skolach

Ostatní

  • Rok uplatnění

    2024

  • Kód důvěrnosti údajů

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Údaje specifické pro druh výsledku

  • Název periodika

    Mathematics

  • ISSN

    2227-7390

  • e-ISSN

    2227-7390

  • Svazek periodika

    12

  • Číslo periodika v rámci svazku

    10

  • Stát vydavatele periodika

    CH - Švýcarská konfederace

  • Počet stran výsledku

    16

  • Strana od-do

  • Kód UT WoS článku

    001231638100001

  • EID výsledku v databázi Scopus