Answers are grounded in this paper and cite their sources.
Uncovers the d-distance p-packing domination number in graph strong products, suggesting new bounds for analysis.
The d -distance p -packing domination number γ dᵖ(G) γ d p ( G ) of a graph G is the cardinality of a smallest set of vertices of G which is both a d -distance dominating set and a p -packing. If no such set exists, then we set γ dᵖ(G) = ∞ γ d p ( G ) = ∞ . For an arbitrary strong product G H G ⊠ H it is proved that γ dᵖ(G H) ≤ γ dᵖ(G) γ dᵖ(H) γ d p ( G ⊠ H ) ≤ γ d p ( G ) γ d p ( H ) . By proving that γ dᵖ(Pₘ Pₙ) = m/2d+1 n/2d+1 γ d p ( P m ⊠ P n ) = ⌈ m 2 d + 1 ⌉ ⌈ n 2 d + 1 ⌉ , and that if γ dᵖ(Cₙ) < ∞ γ d p ( C n ) < ∞ , then γ dᵖ(Pₘ Cₙ) = m/2d+1 n/2d+1 γ<
No takes yet. Share an insight, caveat, or question.
Bujtás et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: