On Domination Polynomials of Caterpillar Graphs
MakaleYalnız künye
Özet
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.
Anahtar Kelimeler
RDL Kalıcı Bağlantı (PID)
https://rdlopen.rawdatalibrary.net/r/bayburt/15204Resmi atıflarda kullanılan kalıcı adresİndeks kayıtları
Kaydın indeks veri tabanlarındaki sayfası (aktarımda alınan kayıt numarasıyla). Erişim, indeksin kendi koşullarına bağlıdır.
Atıflar
- TR Dizin
- 0
Tam Kayıt
| Alan | Değer | Dil |
|---|---|---|
| dc.contributor.author | Şahin, Abdulgani | |
| dc.contributor.author | Şahin, Bünyamin | |
| dc.date.accessioned | 2026-10-29T19:20:12.482614669Z | |
| dc.date.available | 2026-10-29T19:20:12.482614669Z | |
| dc.date.issued | 2018 | |
| dc.description.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. | |
| dc.identifier.eissn | 2148-1830 | |
| dc.identifier.endpage | 38 | |
| dc.identifier.issue | 9 | |
| dc.identifier.startpage | 34 | |
| dc.identifier.uri | https://rdlopen.rawdatalibrary.net/r/bayburt/15204 | |
| dc.identifier.volume | 9 | |
| dc.language.iso | en | |
| dc.relation.ispartof | Turkish Journal of Mathematics and Computer Science | |
| dc.rights | info:eu-repo/semantics/closedAccess | |
| dc.subject | Matematik | |
| dc.title | On Domination Polynomials of Caterpillar Graphs | |
| dc.type | Article | |
| rdl.citation.trdizin | 0 | |
| rdl.source.index | TRDIZIN |