Bounds on the Exponential Domination Number
Stephane Bessy, Pascal Ochem, Dieter Rautenbach

TL;DR
This paper investigates bounds on the exponential domination number in graphs, providing new lower and upper bounds that improve upon previous results, with implications for understanding domination in complex networks.
Contribution
It introduces tighter bounds on the exponential domination number, especially strengthening the upper bound for connected graphs with given parameters.
Findings
Established a new lower bound involving maximum degree and graph size.
Improved the upper bound for the exponential domination number based on graph radius.
Provided an enhanced upper bound of (43/108)(n+2) for connected graphs.
Abstract
As a natural variant of domination in graphs, Dankelmann et al. [Domination with exponential decay, Discrete Math. 309 (2009) 5877-5883] introduce exponential domination, where vertices are considered to have some dominating power that decreases exponentially with the distance, and the dominated vertices have to accumulate a sufficient amount of this power emanating from the dominating vertices. More precisely, if is a set of vertices of a graph , then is an exponential dominating set of if for every vertex in , where is the distance between and in the graph . The exponential domination number of is the minimum order of an exponential dominating set of . Dankelmann et…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Complexity and Algorithms in Graphs · Interconnection Networks and Systems
