On Domination Polynomials of Caterpillar Graphs

Basit Öğe Kaydı
dc.contributor.authorŞahin, Bünyamin
dc.contributor.authorŞahin, Abdulgani
dc.date.accessioned2024-10-04T19:06:33Z
dc.date.available2024-10-04T19:06:33Z
dc.date.issued2018
dc.departmentBayburt Üniversitesien_US
dc.description.abstractThe 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.endpage38en_US
dc.identifier.issn2148-1830
dc.identifier.issue9en_US
dc.identifier.startpage34en_US
dc.identifier.trdizinid349313en_US
dc.identifier.urihttps://search.trdizin.gov.tr/tr/yayin/detay/349313
dc.identifier.urihttp://hdl.handle.net/20.500.12403/4583
dc.identifier.volume9en_US
dc.indekslendigikaynakTR-Dizinen_US
dc.language.isoenen_US
dc.relation.ispartofTurkish Journal of Mathematics and Computer Scienceen_US
dc.relation.publicationcategoryMakale - Ulusal Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.titleOn Domination Polynomials of Caterpillar Graphsen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

TR-Dizin İndeksli Yayınlar Koleksiyonu