Coverings, matchings and paired domination in fuzzy graphs using strong arcs
نویسندگان
1 National institute of technology
2 Dept. of Mathematics, National Institute of Technology, Calicut, Kerala
doi
10.22111/ijfs.2019.4490چکیده
The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the strong paired domination number of fuzzy graphs. An upper bound for the strong paired domination number of fuzzy graphs in terms of strong independence number is also obtained.
