Domination subdivision number
Материал из WikiGrapp
Domination subdivision number --- доминирующее число подразбиения.
The domination subdivision number [math]\displaystyle{ sd_{\gamma}(G) }[/math] of a graph [math]\displaystyle{ G }[/math] is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the domination number. It is known that this number is at most 3 for any tree.
See also
- Independence subdivision number.
