<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05526253</id>
  <dt>j</dt>
  <an>05526253</an>
  <augroup>
    <au>Chen, Yu</au>
    <au>Chen, Baoxing</au>
    <au>Xie, Xiaohua</au>
  </augroup>
  <ti>Optimal designs of Abelian Cayley digraphs with degree 2.</ti>
  <so>J. Zhangzhou Norm. Univ., Nat. Sci. 20, No. 4, 15-20 (2007).</so>
  <py>2007</py>
  <pu>Editorial Department of Journal of Zhangzhou Normal University, Zhangzhoum Fujian</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>Cayley digraph</ut>
    <ut>diameter</ut>
    <ut>Abelian group</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
  </ligroup>
  <abgroup>
    <ab>Summary: Let $G$ be a finite Abelian group with a two element generating set $M$. We consider the Cayley digraph $D(G, M)$ in which the vertices are corresponding to the elements of $G$ and there is an arc from $x$ to $y$ if and only if $y-x \in M$. An attention deserving problem is: for a given positive integer $N$, what is the minimum value of the diameters among all such connected Cayley digraphs on $N$ vertices of finite Abelian groups with degree 2? In this paper, a fast algorithm is given to compute this minimum value, and with our algorithm, we can find an Abelian Cayley digraph with degree 2 whose diameter is minimal.</ab>
    <rv></rv>
  </abgroup>
</item>