Porous Exponential Domination in Harary Graphs

A porous exponential dominating set of a graph G is a subset S such that, for every vertex v of G, n-ary sumation (u is an element of S)(1/2)(d(u, v)-1) >= l, where d(u, v) is the distance between vertices u and v. the porous exponential domination number, gamma e*(G), is the minimum cardinality of a porous exponential dominating set. in this paper, we determine porous exponential domination number of the Harary graph H-k,H-n for all k and n.