Set Domination in Fuzzy Graphs Using Strong Arcs

Manjusha, O.T.

doi:10.28919/cpr-pajm/1-9

Research article

Set Domination in Fuzzy Graphs Using Strong Arcs

O.T. Manjusha

Abstract

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.

How to cite

O. T. Manjusha, Set Domination in Fuzzy Graphs Using Strong Arcs, Pan-Amer. J. Math. 1 (2022), 9. https://doi.org/10.28919/cpr-pajm/1-9

BibTeX

@article{Manjusha2022,
  author  = {Manjusha, O.T.},
  title   = {Set Domination in Fuzzy Graphs Using Strong Arcs},
  journal = {Pan-Amer. J. Math.},
  volume  = {1},
  year    = {2022},
  pages   = {9},
  doi     = {10.28919/cpr-pajm/1-9}
}