Perfect Italian domination in graphs: Complexity and algorithms

An Italian dominating function on a simple undirected graph G is a function f:V(G)⟶{0,1,2} satisfying the condition that for each vertex v with f(v)=0, ∑u∈NG(v)f(u)≥2. An Italian dominating function f on G is called a perfect Italian dominating function on G if for each vertex v with f(v)=0, ∑u∈NG(v...

Full description

Bibliographic Details

Published in:	Discrete Applied Mathematics Vol. 319; pp. 271 - 295
Main Authors:	Pradhan, D., Banerjee, S., Liu, Jia-Bao
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 15.10.2022
Subjects:	Domination Italian domination NP-complete Perfect Italian domination Polynomial time algorithm Domination NP-complete Italian domination Polynomial time algorithm Perfect Italian domination
ISSN:	0166-218X, 1872-6771
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!