Publication:
An investigation of new graph invariants related to the domination number of random proximity catch digraphs

Placeholder

Departments

School / College / Institute

Program

KU-Authors

KU Authors

Co-Authors

Publication Date

Language

Embargo Status

Journal Title

Journal ISSN

Volume Title

Alternative Title

Abstract

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.

Source

Publisher

Springer

Subject

Statistics, Probability

Citation

Has Part

Source

Methodology and Computing in Applied Probability

Book Series Title

Edition

DOI

10.1007/s11009-010-9204-9

item.page.datauri

Link

Rights

Copyrights Note

Endorsement

Review

Supplemented By

Referenced By

0

Views

0

Downloads

View PlumX Details