Every claw-free graph has equal standard and positive semidefinite zero forcing numbers, and this hereditary equality characterizes claw-free graphs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A Characterization of Claw-Free Graphs using Zero Forcing Invariants
Every claw-free graph has equal standard and positive semidefinite zero forcing numbers, and this hereditary equality characterizes claw-free graphs.