[1]罗祖文,徐丽琼.由2-树生成的Cayley图的容错极大局部连通性[J].集美大学学报(自然版),2018,23(5):378-384.
 LUO Zuwen,XU Liqiong.Fault Tolerant Maximal Local Connectivity of Cayley Graphs Generated by 2-trees[J].Journal of Jimei University,2018,23(5):378-384.
点击复制

由2-树生成的Cayley图的容错极大局部连通性()
分享到:

《集美大学学报(自然版)》[ISSN:1007-7405/CN:35-1186/N]

卷:
第23卷
期数:
2018年第5期
页码:
378-384
栏目:
数理科学与信息工程
出版日期:
2018-09-28

文章信息/Info

Title:
Fault Tolerant Maximal Local Connectivity of Cayley Graphs Generated by 2-trees
作者:
罗祖文徐丽琼
(集美大学理学院,福建 厦门 361021)
Author(s):
LUO ZuwenXU Liqiong
(School of Science,Jimei University,Xiamen 361021,China)
关键词:
容错性极大局部连通Cayley图2-树
Keywords:
fault tolerancemaximal local connectivityCayley graphs2-trees
文献标志码:
A
摘要:
主要证明了由2-树生成的Cayley图An(Δ)(n≥5)是(2n-7)容错极大局部连通和一对多(2n-7)容错极大局部连通。限制每个顶点有至少3个无故障邻点,则An(Δ)(n≥5)是(4n-15)容错极大局部连通。
Abstract:
It was shown that Cayley graphs An(Δ) generated by 2-trees is (2n-7)??????-fault??????-tolerant maximally local connected for n≥5 and is also(2n-7)fault??????-tolerant one??????-to??????-many maximally local??????-connected for n≥5.Furthermore,under the restricted condition that each vertex has at least three fault??????-free adjacent vertices,Cayley graphs An(Δ) generated by 2??????-trees is(4n-15)fault??????-tolerant maximally local connected for n≥5.
更新日期/Last Update: 2018-11-08