Abstract
An Italian dominating function on a (di)graph G with vertex set V(G) is a function f:V(G)→{0,1,2} such that every vertex v∈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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
