On the E-Optimality of Regular Graph Designs
研究了正则图设计在区组设计中的E最优性，给出了存在E最优正则图设计的充分条件，并通过例子说明如何应用这些条件。
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.