independence domination number
maximum, over all independent sets πΌ, of the minimum number of vertices required to dominate πΌ
Press Enter Β· cited answer in seconds
0 sources
independence domination number
Summary
independence domination number is a graph property[1].
Key Facts
- independence domination number's instance of is recorded as graph property[2].
- independence domination number's facet of is recorded as Vizing's conjecture[3].
- independence domination number's codomain is recorded as set of non-negative integers[4].
- independence domination number's different from is recorded as independent domination number[5].
- independence domination number's defining formula is recorded as \gamma^i(G)=\max_I \gamma(I)[6].
- independence domination number's less than is recorded as domination number[7].
- independence domination number's maintained by WikiProject is recorded as WikiProject Mathematics[8].
- independence domination number's in defining formula is recorded as \gamma^i[9].
- independence domination number's in defining formula is recorded as \gamma[10].
- independence domination number's in defining formula is recorded as I[11].