On Domination Polynomials of Caterpillar Graphs
dc.contributor.author | Şahin, Bünyamin | |
dc.contributor.author | Şahin, Abdulgani | |
dc.date.accessioned | 2024-10-04T19:06:33Z | |
dc.date.available | 2024-10-04T19:06:33Z | |
dc.date.issued | 2018 | |
dc.department | Bayburt Üniversitesi | en_US |
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. | en_US |
dc.identifier.endpage | 38 | en_US |
dc.identifier.issn | 2148-1830 | |
dc.identifier.issue | 9 | en_US |
dc.identifier.startpage | 34 | en_US |
dc.identifier.trdizinid | 349313 | en_US |
dc.identifier.uri | https://search.trdizin.gov.tr/tr/yayin/detay/349313 | |
dc.identifier.uri | http://hdl.handle.net/20.500.12403/4583 | |
dc.identifier.volume | 9 | en_US |
dc.indekslendigikaynak | TR-Dizin | en_US |
dc.language.iso | en | en_US |
dc.relation.ispartof | Turkish Journal of Mathematics and Computer Science | en_US |
dc.relation.publicationcategory | Makale - Ulusal Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.title | On Domination Polynomials of Caterpillar Graphs | en_US |
dc.type | Article | en_US |