A graph is CF-dense when every vertex lies in some minimum connected forcing set; the paper characterizes CF-dense trees and counts connected forcing sets in trees.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Connected forcing density and related problems
A graph is CF-dense when every vertex lies in some minimum connected forcing set; the paper characterizes CF-dense trees and counts connected forcing sets in trees.