Atay, BetulAytac, Aysun2019-10-272019-10-2720172008-68222008-6822https://doi.org/10.22075/ijnaa.2017.3056.1494https://hdl.handle.net/11454/32033An 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.en10.22075/ijnaa.2017.3056.1494info:eu-repo/semantics/closedAccessGraph vulnerabilitynetwork design and communicationexponential domination numberedge coronaneighbourhood coronaArticle82243250WOS:000423905300021N/A