An Investigation of New Graph Invariants Related to the Domination Number of Random Proximity Catch Digraphs

摘要

Proximity catch digraphs (PCDs) are a special type of proximity graphs based on proximity maps which yield proximity regions. PCDs are defined using the relative allocation of points from two or more classes in a region of interest and have applications in various fields. We introduce some auxiliary tools for PCDs and graph invariants related to the domination number of the PCDs and investigate their probabilistic properties. We consider the cases in which the vertices of the PCDs come from uniform and non-uniform distributions in the region of interest. We also provide some of the newly defined proximity maps as illustrative examples.