Cycle embedding of augmented cubes
作者：
Highlights：
•
摘要
A graph G=(V,E) is vertex-pancyclic if for every vertex u and any integer l ranging from a positive constant L to |V|, G contains a cycle C of length l such that u is in C. In this paper, we show that an n-dimensional augmented cube, where n⩾2, is vertex-pancyclic with L=3.
论文关键词：Graph-theoretic interconnection networks,Augmented cubes,Vertex-pancyclicity,Cycle embedding
论文评审过程：Available online 28 February 2007.
论文官网地址：https://doi.org/10.1016/j.amc.2007.02.089
