Abstract: A vertex set D ⊆ V is considered a dominating set of G if every vertex in V − D is adjacent to at least one vertex in D. We called a dominating set D as a paired-dominating set if the ...
Consider an urn model where at each step one of q colors is sampled according to some probability distribution and a ball of that color is placed in an urn. The distribution of assigning balls to urns ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback