Edge-fault-tolerant vertex-pancyclicity of augmented cubes

Authors:
Jung-Sheng Fu
Affiliations:
Department of Electronic Engineering, National United University, Miaoli, Taiwan
Venue:
Information Processing Letters
Year:
2010

Citing 15
Cited 2

Embedding of Cycles in Arrangement Graphs

IEEE Transactions on Computers
The Hyper-deBruijn Networks: Scalable Versatile Architecture

IEEE Transactions on Parallel and Distributed Systems
Edge-pancyclicity of recursive circulants

Information Processing Letters
Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs

Networks
Fault hamiltonicity of augmented cubes

Parallel Computing
Hamiltonian Path Embedding and Pancyclicity on the Möbius Cube with Faulty Nodes and Faulty Edges

IEEE Transactions on Computers
The forwarding indices of augmented cubes

Information Processing Letters
Geodesic pancyclicity and balanced pancyclicity of Augmented cubes

Information Processing Letters
Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes

Parallel Computing
Fault-tolerant pancyclicity of augmented cubes

Information Processing Letters
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements

Theoretical Computer Science
Edge-bipancyclicity of conditional faulty hypercubes

Information Processing Letters
Panconnectivity and edge-pancyclicity of faulty recursive circulant G(2m,4)

Theoretical Computer Science
The super connectivity of augmented cubes

Information Processing Letters
Edge-fault-tolerant node-pancyclicity of twisted cubes

Information Processing Letters

Pancyclicity of ternary n-cube networks under the conditional fault model

Information Processing Letters
Conditional edge-fault pancyclicity of augmented cubes

Theoretical Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

The n-dimensional augmented cube, denoted as AQ"n, a variation of the hypercube, possesses some properties superior to those of the hypercube. In this paper, we show that every vertex in AQ"n lies on a fault-free cycle of every length from 3 to 2^n, even if there are up to n-1 edge faults. We also show that our result is optimal.