Article ID Journal Published Year Pages File Type
438436 Theoretical Computer Science 2014 12 Pages PDF
Abstract

The (n,k)(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)(n,k)-star graphs are 6-weak-vertex-pancyclic for k

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
(n−3)(n−3)-edge-fault-tolerant weak-pancyclicity of (n,k)(n,k)-star graphs
Authors
, , ,