[PDF] Top 20 Fault Hamiltonicity and fault Hamiltonian connectivity of the (n, k)-star graphs

... Keywords: Hamiltonian cycle; Hamiltonian connected; (n, k)- star graph ...INTRODUCTION The architecture of an interconnection network is usually represented by a ... See full document

... view of A n;2 and then present some of its special ...A n;2 consists of nðn
1Þ vertices and nðn
1Þðn
2Þ ...into n ... See full document

... Keywords: hamiltonian, hamiltonian connected, fault-tolerant hamiltonian, fault-tolerant hamiltonian connected, fully connected cubic network ...studies of parallel ... See full document

... | n is a positive integer}. Moreover, FP Q 0,1 is neither hamiltonian nor hamil- tonian ...Q n,0 is hamiltonian but not hamiltonian connected if n > 1; F P Q 1,0 is ... See full document

... concept of mutually independent hamiltonian paths arises from the following ...are k pieces of data needed to be sent from u to v, and the data need to be processed at ... See full document

... that the maximum number of mutually independent Hamiltonian cycles rooted at any vertex can be constructed recursively in the star graph interconnection network (for the detailed ... See full document

... adopting the conditional fault model and assuming that there were two or more non-faulty edges incident to each node, we showed that an n-dimensional pancake graph contains a fault-free ... See full document

... hypercube and hyperbus structures for a computer net- ...(2009) The super spanning connectivity and super spanning laceability of the enhanced ... See full document

... studies of parallel architectures, we restrict our attention to a set of identical processors, and we view the architectures of the underlying interconnection networks as ... See full document

... The star graph is a famous interconnection ...investigate the edge fault tolerance and adjacent vertex fault tolerance for some Hamiltonian property of the ... See full document

... v k . The length of the path is ...that the path is a cycle if v 0 = v k ...is hamiltonian with respect to a graph G if it crosses all vertices of ...Department ... See full document

... an n-dimensional Star ...is Hamiltonian laceable where F is the set of f ?(n?4) pairs of adjacent faulty vertices, Sn?F is Hamiltonian where F is the set ... See full document

... The Hamiltonian property is one of major requirements in designing the topology of ...networks. Fault tolerance is also required for distributed ...introduce the concepts ... See full document

... subject of the multi-process com- puter systems. Graphs are usually used to represent the interconnection architecture of these systems, where vertices represent processors and ... See full document

... cubes, and so on. These varia- tions preserve most of the good topological properties of the hypercube, and even ...example, the diameter of these variation cubes ... See full document

... Institute of Information Science, Academia Sinica, Taipei, Taiwan 115, Republic of China In this paper, we present three construction schemes for fault-tolerant Hamiltonian ...on ... See full document

... i=1 k i . Therefore, anybipartite graph G with
(G)  3 is not k ∗ -connected for any3
k

...is k ∗ -laceable if there exists a k ∗ -container between any two vertices from ... See full document

... Applications of the concept of mutually independent hamiltonian cycles Mutually independent hamiltonicity of graphs can be applied to many ...Consider the following ... See full document

... use graphs and networks interchangeably. There are a lot of mutually conflict- ing requirements in designing the topology of interconnection ...on the requirements and its ... See full document

... on the hypercube with lower diameter'', IEEE Transactions on Computers, ...Journal of Combinatorial Theory, ...Chen, and Chin-Wen Ho, ``Longest fault-free paths in Star Graphs ... See full document