Defines α_es(G) as max independent set with external domination support, proves NP-hardness in general and linear-time solvability on trees, plus sharp bounds.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Establishes that ι/γ₂ < 2 holds for all trees while γ/ρ_L is unbounded there, gives class-specific bounds on γ/ρ_L, and shows every tree admits an isolating packing set.
citing papers explorer
-
On externally supported independence number of graphs
Defines α_es(G) as max independent set with external domination support, proves NP-hardness in general and linear-time solvability on trees, plus sharp bounds.
-
On the Relationships between Domination, Isolation, and Packing
Establishes that ι/γ₂ < 2 holds for all trees while γ/ρ_L is unbounded there, gives class-specific bounds on γ/ρ_L, and shows every tree admits an isolating packing set.