Perfect Italian Domination on Structured Bipartite Graphs: Algorithms, Parameterization, and Hardness
A perfect Italian dominating function assigns values in {0,1,2} to the vertices of a graph so that every zero-valued vertex has a neighbor-value sum of exactly two. We determine the computational complexity of the problem for bipartite graphs whose neighborhoods are subtrees of a simple host tree. On convex bipartite g...