Semitotal domination number of some graph operations

dc.contributor.authorYildiz, Zeliha Kartal
dc.contributor.authorAytac, Aysun
dc.date.accessioned2021-05-03T20:28:06Z
dc.date.available2021-05-03T20:28:06Z
dc.date.issued2021
dc.departmentEge Üniversitesien_US
dc.description.abstractA semitotal dominating set S (abbreviated semi-TD-set) of graph G = (V, E) is a subset such that S is a dominating set and each vertex in the S is within 2 distance from the another vertex of S. The semitotal domination number, denoted by gamma(t2)(G), is the minimum cardinality taken over all semitotal dominating sets of G. in this paper, we examine the semitotal domination number of graphs obtained by some graph operations such as corona, join, modular product, and lexicographic product.en_US
dc.description.sponsorshipEge University PhD Scientific Research ProjectEge University [FDK-2018-20266]en_US
dc.description.sponsorshipEge University PhD Scientific Research Project, Grant/Award Number: FDK-2018-20266.en_US
dc.identifier.doi10.1002/num.22746
dc.identifier.issn0749-159X
dc.identifier.issn1098-2426
dc.identifier.issn0749-159Xen_US
dc.identifier.issn1098-2426en_US
dc.identifier.scopus2-s2.0-85100178486en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.urihttps://doi.org/10.1002/num.22746
dc.identifier.urihttps://hdl.handle.net/11454/69741
dc.identifier.wosWOS:000608906600001en_US
dc.identifier.wosqualityQ1en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherWileyen_US
dc.relation.ispartofNumerical Methods For Partial Differential Equationsen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectdominationen_US
dc.subjectgraph operationsen_US
dc.subjectgraph theoryen_US
dc.subjectsemitotal dominationen_US
dc.titleSemitotal domination number of some graph operationsen_US
dc.typeArticleen_US

Dosyalar