The d-distance p-packing domination number: complexity, cycles, and trees

February 20, 2026Aequationes MathematicaeOpen Access

View Full Paper

Ask AI

Bookmark

Share

Key Points

This research aims to analyze the d-distance p-packing domination number in graphs, focusing on its complexity and conditions in cycles and trees.
Define d-distance dominating sets and p-packing criteria.
Investigate the NP-completeness of the decision problem for bipartite planar graphs.
Establish necessary and sufficient conditions for d-distance p-packing dominating sets in cycle graphs.
The decision problem for d-distance p-packing domination number is shown to be NP-complete in bipartite planar graphs.
Specific conditions are identified for the existence of d-distance p-packing dominating sets in cycle graphs.

We only have this paper's title and publication details.

Analysis reveals NP-completeness of the domination number decision problem in bipartite planar graphs, suggesting complexity in graph theory.

No takes yet. Share an insight, caveat, or question.

Bujtá et al. (2026) studied this question.

View Full Paper

Ask AI

Bookmark

Share