✨
AI Summary & Key Takeaways
AI Insight⚡ TL;DR(Too Long; Didn't Read)
An algorithm for finding a minimal complementary nil dominating set of fuzzy graph is studied with suitable examples.
📌 3 Key Takeaways
🎯
Objective & Hypothesis:In this paper, effective adjacency matrix of a fuzzy graph is introduced.
📊
Key Findings & Data:In this paper, effective adjacency matrix of a fuzzy graph is introduced.
💡
Conclusion & Impact:An algorithm for finding a minimal complementary nil dominating set of fuzzy graph is studied with suitable examples.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Fuzzy Graph · dominating set
Abstract
In this paper, effective adjacency matrix of a fuzzy graph is introduced. An algorithm for finding a minimal complementary nil dominating set of fuzzy graph is studied with suitable examples.
Keywords
🔖
Cite This Article
ISMAYİL, A., ALİ, A. (2017). An algorithm for finding complementary nil dominating set in a fuzzy graph. New Trends in Mathematical Sciences, Cilt: 5 Sayı: 3, 1–6. https://ajindex.com/articles/1003694