On the average order of a dominating set of a forest

Basit Öğe Kaydı
dc.contributor.authorErey, Aysel
dc.date.accessioned2025-10-29T11:29:25Z
dc.date.issued2023
dc.departmentFakülteler, Temel Bilimler Fakültesi, Matematik Bölümü
dc.description.abstractWe show that the average order of a dominating set of a forest graph G on n vertices with no isolated vertices is at most 2n/3. Moreover, the equality is achieved if and only if every non-leaf vertex of G is a support vertex with one or two leaf neighbors. Our result answers an open question of Beaton and Brown in [The average order of dominating sets of a graph, Discrete Math. 344(12) (2021)]. (C) 2022 Elsevier B.V. All rights reserved.
dc.identifier.doi10.1016/j.disc.2022.113127
dc.identifier.issn0012-365X
dc.identifier.issn1872-681X
dc.identifier.issue1
dc.identifier.scopus2-s2.0-85136108579
dc.identifier.scopusqualityQ2
dc.identifier.urihttps://doi.org/10.1016/j.disc.2022.113127
dc.identifier.urihttps://hdl.handle.net/20.500.14854/11085
dc.identifier.volume346
dc.identifier.wosWOS:000850160000014
dc.identifier.wosqualityQ3
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.institutionauthorErey, Aysel
dc.language.isoen
dc.publisherElsevier
dc.relation.ispartofDiscrete Mathematics
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/openAccess
dc.snmzKA_WOS_20251020
dc.subjectDominating set
dc.subjectAverage order
dc.subjectForest
dc.titleOn the average order of a dominating set of a forest
dc.typeArticle

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu
Temel Bilimler Fakültesi Koleksiyonu