Ciftci, C.Aytac, A.2020-12-012020-12-0120200001-43461573-88760001-43461573-8876https://doi.org/10.1134/S0001434620010228https://hdl.handle.net/11454/63009A 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.en10.1134/S0001434620010228info:eu-repo/semantics/closedAccessgraph theoryporous exponential dominationHarary graphArticle1071-2231237WOS:0005195551000222-s2.0-85081021599N/AQ4