Aytac, A.; Ciftci, C.
(MAIK NAUKA/INTERPERIODICA/SPRINGER, 233 SPRING ST, NEW YORK, NY 10013-1578 USA, 2020)
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 ...