Domination integrity and efficient fuzzy graphs

Simple item page
dc.contributor.authorMariappan S.
dc.contributor.authorRamalingam S.
dc.contributor.authorRaman S.
dc.contributor.authorBacak-Turan G.
dc.date.accessioned2024-07-22T08:07:26Z
dc.date.available2024-07-22T08:07:26Z
dc.date.issued2020
dc.description.abstractIn this paper, domination integrity of fuzzy graph and efficient fuzzy graph concepts is introduced with examples. An algorithm is developed to find whether an arc is strong or not. If it is strong, another algorithm will classify it as α strong arc and β strong arc. The next algorithm is used to find whether the given fuzzy graph is a fuzzy tree or not. Domination and integrity are two different parameters used to define the stability of a graph in various situations. Using the strong arc concept a new parameter, domination integrity is defined and lower and upper bounds are found. This paper discusses the domination integrity for standard graphs such as path, cycle and complete graph. The domination integrity for Cartesian product of fuzzy graphs is also discussed. Finally, the new class of fuzzy graph, efficient fuzzy graph, is introduced. Efficient fuzzy graph is a special type of fuzzy graph that has the same dominating set, other than vertex set V, for both fuzzy graph and its underlying crisp graph. © 2019, Springer-Verlag London Ltd., part of Springer Nature.
dc.identifier.DOI-ID10.1007/s00521-019-04563-5
dc.identifier.issn09410643
dc.identifier.urihttp://akademikarsiv.cbu.edu.tr:4000/handle/123456789/13966
dc.language.isoEnglish
dc.publisherSpringer
dc.subjectFuzzy sets
dc.subjectCartesian Products
dc.subjectComplete graphs
dc.subjectDominating sets
dc.subjectFuzzy graph
dc.subjectLower and upper bounds
dc.subjectNew parameters
dc.subjectStrong arcs
dc.subjectVertex integrity
dc.subjectTrees (mathematics)
dc.titleDomination integrity and efficient fuzzy graphs
dc.typeArticle

Files

Collections

Scopus Koleksiyonu