Invariants Concerning f-Domination in Graphs
Bulletin of the Malaysian Mathematical Society, Tome 37 (2014) no. 4
Cet article a éte moissonné depuis la source Bulletin of the Malaysian Mathematical Society website
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.
Classification :
05C69
@article{BMMS_2014_37_4_a10,
author = {Sanming Zhou},
title = {Invariants {Concerning} {f-Domination} in {Graphs}},
journal = {Bulletin of the Malaysian Mathematical Society},
year = {2014},
volume = {37},
number = {4},
url = {http://geodesic.mathdoc.fr/item/BMMS_2014_37_4_a10/}
}
Sanming Zhou. Invariants Concerning f-Domination in Graphs. Bulletin of the Malaysian Mathematical Society, Tome 37 (2014) no. 4. http://geodesic.mathdoc.fr/item/BMMS_2014_37_4_a10/