Exponential Independence in Subcubic Graphs

Stéphane Bessy, Johannes Pardey, Dieter Rautenbach

A set $S$ of vertices of a graph $G$ is exponentially independent if, for every vertex $u$ in $S$, $$\sum\limits_{v\in S\setminus \{ u\}}\left(\frac{1}{2}\right)^{{\rm dist}_{(G,S)…