On total 2-domination in Cartesian product of complete graphs. (arXiv:2001.0 ...

On total 2-domination in Cartesian product of complete graphs. (arXiv:2001.07850v1 (math.CO))

 Datum : Thu, 23 Jan 2020 01:30:00 GMT Zdroj : math updates on arXiv.org Odkaz : http://arxiv.org/abs/2001.07850

Let $G=(V,E)$ be a finite undirected graph. A set $S$ of vertices in $V$ is said to be \emph{total $k$-dominating} if every vertex in $V$ is adjacent to at least $k$ vertices in $S$. The \emph{total ... >>>>>

 ClipBox Přidat záznamy do ClipBoxu