A Study on Double, Triple and N - Tuple Domination of Fuzzy Graphs

Senthilraj, S.

doi:10.5120/18776-0091

IJCA

2014

DOI: 10.5120/18776-0091

|View full text |Cite

A Study on Double, Triple and N - Tuple Domination of Fuzzy Graphs

S. Senthilraj¹

Abstract: In a graph G, a vertex dominates itself and its neighbors. A subset S of V is called a dominating set in G if every vertex in V-S is adjacent to at least one vertex in S. The minimum cardinality taken over all, the minimal double dominating set which is called Fuzzy Double Domination Number and which is denoted as ) (G fdd

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2022

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

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

et al. 2022

View full text Add to dashboard Cite

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 nctpkD(G) and number γnctpD(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 nctpkD(G) set of fuzzy graphs. The order and size of the strong and weak nctpkD(G) fuzzy set are studied. Additionally, a few related theorems and statements are analyzed.

show abstract

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

et al. 2022

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

A Study on Double, Triple and N - Tuple Domination of Fuzzy Graphs

Cited by 1 publication

References 5 publications

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

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

Contact Info

Product

Resources

About