All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

A Study on Fuzzy Resolving Domination Sets and Their Application in Network Theory

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27230%2F23%3A10251789" target="_blank" >RIV/61989100:27230/23:10251789 - isvavai.cz</a>

  • Result on the web

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

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    A Study on Fuzzy Resolving Domination Sets and Their Application in Network Theory

  • Original language description

    Consider a simple connected fuzzy graph (FG) G and consider an ordered fuzzy subset H = {(u(1), sigma(u(1))), (u(2), sigma(u(2))), horizontal ellipsis (u(k), sigma(u(k)))}, |H| &gt;= 2 of a fuzzy graph; then, the representation of sigma - H is an ordered k-tuple with regard to H of G. If any two elements of sigma - H do not have any distinct representation with regard to H, then this subset is called a fuzzy resolving set (FRS) and the smallest cardinality of this set is known as a fuzzy resolving number (FRN) and it is denoted by Fr(G). Similarly, consider a subset S such that for any u is an element of S, there exists v is an element of V - S, then S is called a fuzzy dominating set only if u is a strong arc. Now, again consider a subset F which is both a resolving and dominating set, then it is called a fuzzy resolving domination set (FRDS) and the smallest cardinality of this set is known as the fuzzy resolving domination number (FRDN) and it is denoted by F-gamma r(G). We have defined a few basic properties and theorems based on this FRDN and also developed an application for social network connection. Moreover, a few related statements and illustrations are discussed in order to strengthen the concept.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    20300 - Mechanical engineering

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2023

  • Confidentiality

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

Data specific for result type

  • Name of the periodical

    Mathematics

  • ISSN

    2227-7390

  • e-ISSN

  • Volume of the periodical

    11

  • Issue of the periodical within the volume

    2

  • Country of publishing house

    CH - SWITZERLAND

  • Number of pages

    9

  • Pages from-to

  • UT code for WoS article

    000927106500001

  • EID of the result in the Scopus database