Study on a Strong and Weak n -Connected Total Perfect k -Dominating set in Fuzzy Graphs

Krishnasamy Elavarasan, Tharmalingam Gunasekar, Lenka Cepova and Robert Cep ()
Additional contact information
Krishnasamy Elavarasan: Department of Mathematics, Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology, Chennai 600 062, India
Tharmalingam Gunasekar: Department of Mathematics, Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology, Chennai 600 062, India
Lenka Cepova: Department of Machining, Assembly and Engineering Metrology, Faculty of Mechanical Engineering, VSB-Technical University of Ostrava, 708 00 Ostrava, Czech Republic
Robert Cep: Department of Machining, Assembly and Engineering Metrology, Faculty of Mechanical Engineering, VSB-Technical University of Ostrava, 708 00 Ostrava, Czech Republic

Mathematics, 2022, vol. 10, issue 17, 1-9

Abstract: In this paper, the concept of a strong n -Connected Total Perfect k -connected total perfect k -dominating set and a weak n -connected total perfect k -dominating set in fuzzy graphs is introduced. In the current work, the triple-connected total perfect dominating set is modified to an n -connected total perfect k -dominating set n c t p k D (G) and number γ n c t p D ( G ) . New definitions are compared with old ones. Strong and weak n -connected total perfect k -dominating set and number of fuzzy graphs are obtained. The results of those fuzzy sets are discussed with the definitions of spanning fuzzy graphs, strong and weak arcs, dominating sets, perfect dominating sets, generalization of triple-connected total perfect dominating sets of fuzzy graphs, complete, connected, bipartite, cut node, tree, bridge and some other new notions of fuzzy graphs which are analyzed with a strong and weak n c t p k D (G) set of fuzzy graphs. The order and size of the strong and weak n c t p k D ( G ) fuzzy set are studied. Additionally, a few related theorems and statements are analyzed.

Keywords: total perfect k -dominating set; n -connected total perfect k -dominating set; strong and weak n -connected total perfect k -dominating set and number (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/10/17/3178/pdf (application/pdf)
https://www.mdpi.com/2227-7390/10/17/3178/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:10:y:2022:i:17:p:3178-:d:905832

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().