摘要
Cayley graphs have many good properties as models of communication networks. This study analyzes the reliability of the Cayley graph based on the dihedral graph. Graph theory and analyses show that almost all Cayley graphs of the dihedral graph D2n are optimal super-λ. The number Ni（G） of cutsets of size i, λ≤ i≤λ＇ is given as Ni（G） = n[^（n-1）δ i-δ].
Cayley graphs have many good properties as models of communication networks. This study analyzes the reliability of the Cayley graph based on the dihedral graph. Graph theory and analyses show that almost all Cayley graphs of the dihedral graph D2n are optimal super-λ. The number Ni（G） of cutsets of size i, λ≤ i≤λ＇ is given as Ni（G） = n[^（n-1）δ i-δ].
基金
Supported by the National Key Basic Research and Development (973) Program of China(No. 2007CB311003)
