applied mathematics
零强迫数
Zero forcing numberA graph invariant used to determine the minimum number of vertices that must change color to force the entire graph to become black. / 一种用于确定迫使整个图变为黑色的最小顶点数的图不变量。
- Knowledge type
- 数学理论
- First proposed or discovered
- Proposer
- Turkey Farm member
- Creator
- 农场主
- Last updated
- 2026-10-23 20:01:30
Sub-knowledge points
No connected node yet
Higher-order knowledge points
No connected node yet
Main parameters and performance indicators
G: The graph under considerationZ(G): The zero forcing number of graph G
Open problems
No unresolved problem recorded yet
Related literature
ranked by community starsThe zero forcing number for cubic Cayley graphs of dihedral groupsOpen source
Related products and links
No item recorded yet
Creation and modification trail
1 recordsRecord title: Zero forcing number.
Node update feedback
review required