On exponential domination and graph operations

dc.contributor.authorAtay, Betul
dc.contributor.authorAytac, Aysun
dc.date.accessioned2019-10-27T11:07:29Z
dc.date.available2019-10-27T11:07:29Z
dc.date.issued2017
dc.departmentEge Üniversitesien_US
dc.description.abstractAn exponential dominating set of graph G = (V, E) is a subset S subset of V (G) such that Sigma(u is an element of S)(1/2)(<(dover bar>(u,v)-1) >= 1 for every vertex v in V (G) - S, where (d) over bar (u,v) is the distance between vertices u is an element of S and v is an element of V(G) - S in the graph G - (S - {u}). The exponential domination number, gamma(e)(G), is the smallest cardinality of an exponential dominating set. Graph operations are important methods for constructing new graphs, and they play key roles in the design and analysis of networks. In this study, we consider the exponential domination number of graph operations including edge corona, neighborhood corona and power.en_US
dc.identifier.doi10.22075/ijnaa.2017.3056.1494
dc.identifier.endpage250en_US
dc.identifier.issn2008-6822
dc.identifier.issn2008-6822en_US
dc.identifier.issue2en_US
dc.identifier.startpage243en_US
dc.identifier.urihttps://doi.org/10.22075/ijnaa.2017.3056.1494
dc.identifier.urihttps://hdl.handle.net/11454/32033
dc.identifier.volume8en_US
dc.identifier.wosWOS:000423905300021en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.language.isoenen_US
dc.publisherSemnan Univen_US
dc.relation.ispartofInternational Journal of Nonlinear Analysis and Applicationsen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectGraph vulnerabilityen_US
dc.subjectnetwork design and communicationen_US
dc.subjectexponential domination numberen_US
dc.subjectedge coronaen_US
dc.subjectneighbourhood coronaen_US
dc.titleOn exponential domination and graph operationsen_US
dc.typeArticleen_US

Dosyalar