An investigation of new graph invariants related to the domination number of random proximity catch digraphs (Q2276421)

Proximity graphs or digraphs are defined from sets of points and classes of regions (neighborhoods) in some metric space. Proximity catch digraphs are defined with two sets of points and a class of regions that should cover one of the point sets and avoid the other point set. The domination number is defined as the size of the minimum dominating point set of the constructed digraph. Using random point sets according to some specified probability distribution, a random proximity catch digraph is obtained. The probability distribution of its domination number is investigated under different assumptions about neighborhoods and rules for digraph construction.