Small domination-type invariants in random graphs

Michitaka Furuya, Tamae Kawasaki

For $c\in {\mathbb{R}}^{+}\cup \{\infty \}$ and a graph $G$, a function $f:V(G)\to \{0,1,c\}$ is called a $c$-self dominating function of $G$ if for every vertex $u\in V(G)$,…