(n-3)-edge-fault-tolerant weak-pancyclicity of (n,k)-star graphs

Authors:
Dyi-Rong Duh;Tzu-Lung Chen;Yue-Li Wang
Affiliations:
Department of Computer Science and Information Engineering, Hwa Hsia Institute of Technology, New Taipei City, Taiwan;Department of Computer Science and Information Engineering, National Chi Nan University, Nantou, Taiwan;Department of Information Management, National Taiwan University of Science and Technology, Taipei, Taiwan
Venue:
Theoretical Computer Science
Year:
2014

Citing 17
Cited 0

Topological Properties of Hypercubes

IEEE Transactions on Computers
The (n,k)-star graph: a generalized star graph

Information Processing Letters
A Single-Chip Multiprocessor

Computer
Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes

Information Processing Letters
Ring Embedding in Faulty (n, k)-star Graphs

ICPADS '01 Proceedings of the Eighth International Conference on Parallel and Distributed Systems
Scaling Up the Atlas Chip-Multiprocessor

IEEE Transactions on Computers
Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs

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

IEEE Transactions on Computers
Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs

Information Processing Letters
Cycle Embedding on Twisted Cubes

PDCAT '06 Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies
Geodesic-pancyclic graphs

Discrete Applied Mathematics
Panconnectivity and edge-pancyclicity of 3-ary N-cubes

The Journal of Supercomputing
Constructing vertex-disjoint paths in (n, k)-star graphs

Information Sciences: an International Journal
Weak-vertex-pancyclicity of (n, k)-star graphs

Theoretical Computer Science
Embedding of Cycles in Twisted Cubes with Edge-Pancyclic

Algorithmica
Edge-pancyclicity of Möbius cubes

Information Processing Letters
Node-pancyclicity and edge-pancyclicity of crossed cubes

Information Processing Letters

Quantified Score

Hi-index	5.23

Visualization

Abstract

The (n,k)-star graphs are a generalized version of n-star graphs, which belong to the class of Cayley graphs, and have been recognized as an attractive alternative to hypercubes for building massively parallel computers. Recently, Chen et al. showed that (n,k)-star graphs are 6-weak-vertex-pancyclic for k=4 and 1@?k