On exponential domination and graph operations
Articles > Article · 2017
Authors: Betul Atay, Aysun AYTAÇ
Web of Science, Journal Indexed in SCI Expanded, International, 2017, vol 8, pp 243-250
DOI: 10.22075/ijnaa.2017.3056.1494
Summary
An 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.