On the limitations of the use of solvable groups in Cayley graph cage constructions

详细信息    查看全文

• 作者：Marston Conder ; Geoffrey Exoo ; Robert Jajcay
• 刊名：European Journal of Combinatorics
• 出版年：2010
• 出版时间：October 2010
• 年：2010
• 卷：31
• 期：7
• 页码：1819-1828
• 全文大小：336 K

文摘

A (k,g)-cage is a (connected) k-regular graph of girth g having smallest possible order. While many of the best known constructions of small k-regular graphs of girth g are known to be Cayley graphs, there appears to be no general theory of the relationship between the girth of a Cayley graph and the structure of the underlying group. We attempt to fill this gap by focusing on the girth of Cayley graphs of nilpotent and solvable groups, and present a series of results supporting the intuitive notion that the closer a group is to being abelian, the less suitable it is for constructing Cayley graphs of large girth. Specifically, we establish the existence of upper bounds on the girth of Cayley graphs with respect to the nilpotency class and/or the derived length of the underlying group, when this group is nilpotent or solvable, respectively.