Set Domination in Fuzzy Graphs Using Strong Arcs

Set domination in fuzzy graphs is very useful for solving traffic problems during communication in computer networks and travelling networks. In this article, the concept of set domination in fuzzy graphs using strong arcs is introduced. The strong set domination number of complete fuzzy graph and c...

Full description

Saved in:
Bibliographic Details
Main Author: O.T. Manjusha
Format: Article
Language:English
Published: Mathyze Publishers 2022-08-01
Series:Pan-American Journal of Mathematics
Online Access:https://mathyze.com/index.php/pajm/article/view/45
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1849419273094561792
author O.T. Manjusha
author_facet O.T. Manjusha
author_sort O.T. Manjusha
collection DOAJ
description Set domination in fuzzy graphs is very useful for solving traffic problems during communication in computer networks and travelling networks. In this article, the concept of set domination in fuzzy graphs using strong arcs is introduced. The strong set domination number of complete fuzzy graph and complete bipartite fuzzy graph is determined. It is obtained the properties of the new parameter and related it to some other known domination parameters of fuzzy graphs. An upper bound for the strong set domination number of fuzzy graphs is also obtained.
format Article
id doaj-art-73fd436b1b224132a8e6e8504edbfc13
institution Kabale University
issn 2832-4293
language English
publishDate 2022-08-01
publisher Mathyze Publishers
record_format Article
series Pan-American Journal of Mathematics
spelling doaj-art-73fd436b1b224132a8e6e8504edbfc132025-08-20T03:32:11ZengMathyze PublishersPan-American Journal of Mathematics2832-42932022-08-011010.28919/cpr-pajm/1-99Set Domination in Fuzzy Graphs Using Strong ArcsO.T. Manjusha0GOOVT ARTS AND SCIENCE COLLEGE, KONDOTTYSet domination in fuzzy graphs is very useful for solving traffic problems during communication in computer networks and travelling networks. In this article, the concept of set domination in fuzzy graphs using strong arcs is introduced. The strong set domination number of complete fuzzy graph and complete bipartite fuzzy graph is determined. It is obtained the properties of the new parameter and related it to some other known domination parameters of fuzzy graphs. An upper bound for the strong set domination number of fuzzy graphs is also obtained.https://mathyze.com/index.php/pajm/article/view/45
spellingShingle O.T. Manjusha
Set Domination in Fuzzy Graphs Using Strong Arcs
Pan-American Journal of Mathematics
title Set Domination in Fuzzy Graphs Using Strong Arcs
title_full Set Domination in Fuzzy Graphs Using Strong Arcs
title_fullStr Set Domination in Fuzzy Graphs Using Strong Arcs
title_full_unstemmed Set Domination in Fuzzy Graphs Using Strong Arcs
title_short Set Domination in Fuzzy Graphs Using Strong Arcs
title_sort set domination in fuzzy graphs using strong arcs
url https://mathyze.com/index.php/pajm/article/view/45
work_keys_str_mv AT otmanjusha setdominationinfuzzygraphsusingstrongarcs