A Study of Independency on Fuzzy Resolving Sets of Labelling Graphs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27230%2F23%3A10252836" target="_blank" >RIV/61989100:27230/23:10252836 - isvavai.cz</a>
Result on the web
<a href="https://www.webofscience.com/wos/woscc/full-record/WOS:001056261100001" target="_blank" >https://www.webofscience.com/wos/woscc/full-record/WOS:001056261100001</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.3390/math11163440" target="_blank" >10.3390/math11163440</a>

Result language
angličtina
Original language name
A Study of Independency on Fuzzy Resolving Sets of Labelling Graphs
Original language description
Considering a fuzzy graph G is simple and can be connected and considered as a subset H = { (u(1), s(u(1))), (u(2), s(u(2))), ...(u(k), s(u(k)))}, |H|= 2; then, every two pairs of elements of s - H have a unique depiction with the relation of H, and H can be termed as a fuzzy resolving set (FRS). The minimal H cardinality is regarded as the fuzzy resolving number (FRN), and it is signified by Fr(G). An independence set is discussed on the FRS, fuzzy resolving domination set (FRDS), and Fuzzy modified antimagic resolving set (FMARS). In this paper, we discuss the independency of FRS and FMARS in which an application has also been developed.
Czech name
—
Czech description
—

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

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

Similar results(10)