✨
AI Summary & Key Takeaways
AI Insight⚡ TL;DR(Too Long; Didn't Read)
In this paper we study the domination polynomials ofcaterpillar graphs.
📌 3 Key Takeaways
🎯
Objective & Hypothesis:The domination polynomial of a simple graph G is calculated with D(G, x) =Pn i=1 d(G, i)x i such thatd(G, i) is the number of the dominating sets of G of size i.
📊
Key Findings & Data:The domination polynomial of a simple graph G is calculated with D(G, x) =Pn i=1 d(G, i)x i such thatd(G, i) is the number of the dominating sets of G of size i.
💡
Conclusion & Impact:In this paper we study the domination polynomials ofcaterpillar graphs.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters
Abstract
The domination polynomial of a simple graph G is calculated with D(G, x) =Pn i=1 d(G, i)x i such thatd(G, i) is the number of the dominating sets of G of size i. In this paper we study the domination polynomials ofcaterpillar graphs.
🔖
Cite This Article
Şahin, A., Şahin, B. (2022). On Domination Polynomials of Caterpillar Graphs. Turkish Journal of Mathematics and Computer Science, Cilt: 9 - Sayı: 9, 34–38. https://ajindex.com/articles/609155