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”

Study on a Strong and Weak n-Connected Total Perfect k-Dominating set in Fuzzy Graphs

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27230%2F22%3A10250271" target="_blank" >RIV/61989100:27230/22:10250271 - isvavai.cz</a>

  • Result on the web

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

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Study on a Strong and Weak n-Connected Total Perfect k-Dominating set in Fuzzy Graphs

  • Original language description

    In this paper, the concept of a strong n-Connected Total Perfect k-connected total perfect k-dominating set and a weak n-connected total perfect k-dominating set in fuzzy graphs is introduced. In the current work, the triple-connected total perfect dominating set is modified to an n-connected total perfect k-dominating set n(ctpkD)(G) and number gamma n(ctpkD)(G). New definitions are compared with old ones. Strong and weak n-connected total perfect k-dominating set and number of fuzzy graphs are obtained. The results of those fuzzy sets are discussed with the definitions of spanning fuzzy graphs, strong and weak arcs, dominating sets, perfect dominating sets, generalization of triple-connected total perfect dominating sets of fuzzy graphs, complete, connected, bipartite, cut node, tree, bridge and some other new notions of fuzzy graphs which are analyzed with a strong and weak n(ctpkD)(G) set of fuzzy graphs. The order and size of the strong and weak n(ctpkD)(G) fuzzy set are studied. Additionally, a few related theorems and statements are analyzed.

  • 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

    2022

  • 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

    2227-7390

  • Volume of the periodical

    10

  • Issue of the periodical within the volume

    17

  • Country of publishing house

    CH - SWITZERLAND

  • Number of pages

    9

  • Pages from-to

    nestrankovano

  • UT code for WoS article

    000851751600001

  • EID of the result in the Scopus database