Open access
Sep 2026
Perfect Italian Domination on Structured Bipartite Graphs: Algorithms, Parameterization, and Hardness
It is proved that the decision problem is NP-complete on star-convex bipartite graphs and the problem parameterized by the target weight is W[1]-hard on the same graph class through a parameter-preserving reduction from Perfect Code.
Renjith Pazhaniappan, Manjusha Mohandas Sathi, M. Malayil
· Mathematics · 0 citations