English

Italian Domination of Cartesian Products of Directed Cycles

Combinatorics 2020-11-03 v1

Abstract

An Italian dominating function on a (di)graph GG with vertex set V(G)V(G) is a function f:V(G){0,1,2}f: V(G) \to \{0, 1, 2\} such that every vertex vV(G)v \in V(G) such that f(v)=0f(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.

Keywords

Cite

@article{arxiv.2011.01078,
  title  = {Italian Domination of Cartesian Products of Directed Cycles},
  author = {Christopher M. van Bommel},
  journal= {arXiv preprint arXiv:2011.01078},
  year   = {2020}
}

Comments

6 pages