Title of article :
On exponential domination and graph operations
Author/Authors :
Atay, Betul Department of Computer and Inst. Tech. Edu - Faculty of Education - Agri Ibrahim Cecen University - Agri, Turkey , Aytac, Aysun Department of Mathematics - Faculty of Science - Ege University - Bornova-Izmir, Turkey
Abstract :
An exponential dominating set of graph G = (V;E) is a subset S ⫃ V (G) such that for every vertex v in V (G)-S, where d(u; v) is the distance between vertices u ∈ S and v ∈ V (G)-S
in the graph G - (S - fug). The exponential domination number,
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.
Keywords :
Graph vulnerability , network design and communication , exponential domination number , edge corona , neighbourhood corona
Journal title :
Astroparticle Physics
