arXiv Analytics

Sign in

arXiv:2011.01078 [math.CO]AbstractReferencesReviewsResources

Italian Domination of Cartesian Products of Directed Cycles

Christopher M. van Bommel

Published 2020-11-02Version 1

An Italian dominating function on a (di)graph $G$ with vertex set $V(G)$ is a function $f: V(G) \to \{0, 1, 2\}$ such that every vertex $v \in V(G)$ such that $f(v) = 0$ has an (in)neighbour assigned 2 or two (in)neighbours assigned 1. We complete the investigation of the Italian domination numbers of Cartesian products of directed cycles.

Related articles: Most relevant | Search more
arXiv:1703.05861 [math.CO] (Published 2017-03-17)
An Improved Bound for Upper Domination of Cartesian Products of Graphs
arXiv:2007.15921 [math.CO] (Published 2020-07-31)
The Localization Game On Cartesian Products
arXiv:1009.1605 [math.CO] (Published 2010-09-08)
Multitriangulations, pseudotriangulations and some problems of realization of polytopes