✨
AI Summary & Key Takeaways
AI Insight⚡ TL;DR(Too Long; Didn't Read)
In this paper we study the domination polynomials of caterpillar graphs.
📌 3 Key Takeaways
🎯
Objective & Hypothesis:The domination polynomial of a simple graph is calculated with such that is the number of the dominating sets of G of size .
📊
Key Findings & Data:The domination polynomial of a simple graph is calculated with such that is the number of the dominating sets of G of size .
💡
Conclusion & Impact:In this paper we study the domination polynomials of caterpillar graphs.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables: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.
🔖
Cite This Article
ŞAHİN, B., ŞAHİN, A. (2018). On Domination Polynomials of Caterpillar Graphs. Turkish Journal of Mathematics and Computer Science, Cilt: 9 - Sayı: 9, 34–38. https://ajindex.com/articles/374702