On the Equality of Domination Number and 2-Domination Number

Basit Öğe Kaydı
dc.authoridBoruzanli Ekinci, Gulnaz/0000-0002-6733-6321
dc.authoridBujtas, Csilla/0000-0002-0511-5291
dc.authorscopusid57205600560
dc.authorscopusid16506446500
dc.contributor.authorEkinci, Gulnaz Boruzanli
dc.contributor.authorBujtas, Csilla
dc.date.accessioned2023-01-12T20:19:13Z
dc.date.available2023-01-12T20:19:13Z
dc.date.issued2022
dc.departmentN/A/Departmenten_US
dc.description.abstractThe 2-domination number gamma(2)(G) of a graph G is the minimum cardinality of a set D subset of V (G) for which every vertex outside D is adjacent to at least two vertices in D. Clearly, gamma(2)(G) cannot be smaller than the domination number gamma(G). We consider a large class of graphs and characterize those members which satisfy gamma(2) = gamma. For the general case, we prove that it is NP-hard to decide whether gamma(2) = gamma holds. We also give a necessary and sufficient condition for a graph to satisfy the equality hereditarily.en_US
dc.description.sponsorshipSlovenian Research Agency [N1-0108]en_US
dc.description.sponsorshipResearch of Csilla Bujt ' as was partially supported by the Slovenian Research Agency under the project N1-0108.en_US
dc.identifier.doi10.7151/dmgt.2452
dc.identifier.issn1234-3099
dc.identifier.issn2083-5892
dc.identifier.issn1234-3099en_US
dc.identifier.issn2083-5892en_US
dc.identifier.scopus2-s2.0-85127857706en_US
dc.identifier.scopusqualityQ3en_US
dc.identifier.urihttps://doi.org/10.7151/dmgt.2452
dc.identifier.urihttps://hdl.handle.net/11454/79060
dc.identifier.wosWOS:000771703600001en_US
dc.identifier.wosqualityQ3en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherSciendoen_US
dc.relation.ispartofDiscussiones Mathematicae Graph Theoryen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectdomination numberen_US
dc.subject2-domination numberen_US
dc.subjecthereditary propertyen_US
dc.subjectcomputational complexityen_US
dc.subjectK-Dominationen_US
dc.subjectAnnihilation Numberen_US
dc.subjectTransversal Numbersen_US
dc.subjectGraphsen_US
dc.subjectBoundsen_US
dc.titleOn the Equality of Domination Number and 2-Domination Numberen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu