首页> 外文期刊>Journal of interconnection networks >Revisiting Constructions of Large Cayley Graphs of Given Degree and Diameter from Regular Orbits
【24h】

Revisiting Constructions of Large Cayley Graphs of Given Degree and Diameter from Regular Orbits

机译:从规则轨道看给定度数和直径的大Cayley图的构造

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

The largest order C(d, k) of a Cayley graph of degree d ≥ 3 and diameter k ≥ 2 cannot exceed the Moore bound M(d, k) the asymptotic form of which is M(d, k) = d~k - O(d~(k-1)) for d → ∞ and a fixed k. The second and the third author~(20) and the three authors~1 proved by direct constructions that the Moore bound for diameter k = 2 and k = 3, respectively, can be approached asymptotically by Cayley graphs in the sense that C(d, k)/M(d, k) → 1 for some sequences of degrees d → ∞. In this note we present a unifying principle underlying the two results, based on the existence of certain regular orbits of automorphism groups of suitable graphs.
机译:d≥3和直径k≥2的Cayley图的最大阶C(d,k)不能超过摩尔定律M(d,k)的渐近形式为M(d,k)= d〜k -O(d〜(k-1))对于d→∞和固定k。第二和第三作者〜(20)和三个作者〜1通过直接构造证明,直径为k = 2和k = 3的摩尔定律可以通过Cayley图渐近地逼近C(d ,对于d→∞的某些序列,k(k)/ M(d,k)→1。在本说明中,我们基于合适图的自同构群的某些规则轨道的存在,提出了这两个结果的统一原理。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号