✨
Yapay Zeka Hızlı Bakış & Çıkarımlar
AI Insight⚡ TL;DR(1 Cümlede Hızlı Çıkarım)
In this paper we study the domination polynomials of caterpillar graphs.
📌 3 Maddede Bu Makale
🎯
Amaç & Hipotez:The domination polynomial of a simple graph is calculated with such that is the number of the dominating sets of G of size .
📊
Temel Bulgular & Veri:The domination polynomial of a simple graph is calculated with such that is the number of the dominating sets of G of size .
💡
Sonuç & Katkı:In this paper we study the domination polynomials of caterpillar graphs.
🔬Tür:Research Article
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:Domination Polynomial · Caterpillar graph
Abstract
The domination polynomial of a simple graph is calculated with such that is the number of the dominating sets of G of size . In this paper we study the domination polynomials of caterpillar graphs.
Anahtar kelimeler
🔖
Bu Makaleye Atıf Yap
Şahin, B., Şahin, A. (2018). On Domination Polynomials of Caterpillar Graphs. Turkish Journal of Mathematics and Computer Science, Volume: 9. https://ajindex.com/articles/1324934