Abstract
A porous exponential dominating set of a graph G is a subset S such that, for every vertex v of G, ∑u∈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, γ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 Hk,n for all k and n.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
