Sampling complete designs

TL;DR

This paper introduces and analyzes the concept of regular sampling in complete graph designs, establishing that the basic necessary condition for such sampling is also sufficient, supported by examples.

Contribution

It defines regular sampling for complete graph designs and proves the sufficiency of the necessary condition, expanding understanding of graph sampling methods.

Findings

Necessary condition for regular sampling is sufficient.

Examples illustrate the application of the theory.

Enhanced understanding of sampling in complete graph designs.

Abstract

In the present paper, complete designs of graphs are considered. The notion of (regular) sampling is introduced and analyzed in detail, showing that the trivial necessary condition for its existence is actually sufficient. Some examples are also provided.