Volume 37 • Number 4 • 2014   • Invariants Concerning f-Domination in Graphs Sanming Zhou Abstract. Given a graph $G$ and a function $f: V(G) \rightarrow \{0, 1, 2,\ldots\}$, a subset $D$ of $V(G)$ is called an $f$-dominating set of $G$ if every vertex $x$ outside $D$ is adjacent to at least $f(x)$ vertices in $D$. In this article we study a few graphical invariants relating to this concept. 2010 Mathematics Subject Classification: 05C69 Full text: PDF