The Italian domination numbers of some products of directed cycles

07/26/2020
by   Kijung Kim, et al.
0

An Italian dominating function on a digraph D with vertex set V(D) is defined as a function f : V(D) →{0, 1, 2} such that every vertex v ∈ V(D) with f(v) = 0 has at least two in-neighbors assigned 1 under f or one in-neighbor w with f(w) = 2. In this paper, we determine the exact values of the Italian domination numbers of some products of directed cycles.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/12/2020

The Italian bondage and reinforcement numbers of digraphs

An Italian dominating function on a digraph D with vertex set V(D) is de...
research
11/17/2020

On k-rainbow domination in middle graphs

Let G be a finite simple graph with vertex set V(G) and edge set E(G). A...
research
10/21/2010

Revisiting deadlock prevention: a probabilistic approach

We revisit the deadlock-prevention problem by focusing on priority digra...
research
03/27/2013

Directed Cycles in Belief Networks

The most difficult task in probabilistic reasoning may be handling direc...
research
11/22/2021

Novel ways of enumerating restrained dominating sets of cycles

Let G = (V, E) be a graph. A set S ⊆ V is a restrained dominating set (R...
research
08/30/2023

Data reduction for directed feedback vertex set on graphs without long induced cycles

We study reduction rules for Directed Feedback Vertex Set (DFVS) on inst...
research
04/07/2020

Cutting cycles of rods in space is FPT

In this short note, we show that cutting cycles of rods is fixed-paramet...

Please sign up or login with your details

Forgot password? Click here to reset