On the E-Optimality of Regular Graph Designs

Abstract

Summary This paper is an investigation into the E-optimality of regular graph designs within various classes of proper block designs. Several sufficient conditions are given for the existence of an E-optimal regular graph design within the classes considered. It is shown that when a regular graph design exists whose minimum non-zero eigenvalue is large enough, then an E-optimal regular graph design exists. Several examples are given to show how the derived sufficient conditions can be applied.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 55 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.