✨
Yapay Zeka Hızlı Bakış & Çıkarımlar
AI Insight⚡ TL;DR(1 Cümlede Hızlı Çıkarım)
An algorithm for finding a minimal complementary nil dominating set of fuzzy graph is studied with suitable examples.
📌 3 Maddede Bu Makale
🎯
Amaç & Hipotez:In this paper, effective adjacency matrix of a fuzzy graph is introduced.
📊
Temel Bulgular & Veri:In this paper, effective adjacency matrix of a fuzzy graph is introduced.
💡
Sonuç & Katkı:An algorithm for finding a minimal complementary nil dominating set of fuzzy graph is studied with suitable examples.
🔬Tür:Araştırma Makalesi
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler: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.
Anahtar kelimeler
🔖
Bu Makaleye Atıf Yap
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