%0 Journal Article
%T On exponential domination and graph operations
%J International Journal of Nonlinear Analysis and Applications
%I Semnan University
%Z 2008-6822
%A Atay, Betul
%A Aytac, Aysun
%D 2017
%\ 12/01/2017
%V 8
%N 2
%P 243-250
%! On exponential domination and graph operations
%K Graph vulnerability
%K network design and communication
%K exponential domination number
%K edge corona
%K neighbourhood corona
%R 10.22075/ijnaa.2017.3056.1494
%X An exponential dominating set of graph $G = (V,E )$ is a subset $S\subseteq V(G)$ such that $\sum_{u\in S}(1/2)^{\overline{d}{(u,v)-1}}\geq 1$ for every vertex $v$ in $V(G)-S$, where $\overline{d}(u,v)$ is the distance between vertices $u \in S$ and $v \in 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.
%U https://ijnaa.semnan.ac.ir/article_2767_30d3be476f5e7e4708605bbc92f6406d.pdf