[PDF] Top 20 Cycle embedding in faulty wrapped butterfly graphs
Has 10000 "Cycle embedding in faulty wrapped butterfly graphs" found on our website. Below are the top 20 most common "Cycle embedding in faulty wrapped butterfly graphs".
Cycle embedding in faulty wrapped butterfly graphs
... Hamiltonian cycle; wrapped butterfly; fault-toler- ant; cycle embedding; Cayley graph ...the wrapped butterfly network is one of the most promising networks due to its nice topological ... See full document
12
Fault-Free Ring Embedding in Faulty Wrapped Butterfly Graphs
... degrees, wrapped butterfly net- work is one of the most promising networks due to its nice topological ...hand, cycle (ring) con- tains several attractive properties such as simplicity, exten- ... See full document
4
Ring embedding in faulty pancake graphs
... Sometimes, a path is also represented by v 0 , v 1 , . . . , v i , e, v i +1 , . . . , v n to emphasize that e is the edge (v i , v i +1 ). We use d(u, v) to denote the distance be- tween u and v, i.e., the length of the ... See full document
5
Fault-free Hamiltonian cycles in faulty butterfly graphs
... r-dimensional k-ary butterfly graph with 2k - 2 edge faults contains a Hamiltonian cycle. However, the proof seems very hard[r] ... See full document
6
Mutually independent hamiltonian cycles of binary wrapped butterfly graphs
... performance in multiprocessor/communication systems. In this paper, the mutually independent hamiltonicity is addressed for its effective utilization of resources on the binary wrapped ... See full document
12
Cycle Embedding on the Edge Fault Star Graphs
... the faulty star graphs. Since components in a network would fail sometimes, to study the graphs with faults in the researches is more ...practice. In this study, we discuss the ... See full document
9
On the isomorphism between cyclic-cubes and wrapped butterfly networks
... Cayley graphs, called cyclic-cubes, which have even fixed ...cyclic-cubes. In [1], Fu and Chou also proposed optimal routing algorithms for G k n ...Hamiltonian cycle, a diameter of b 3n 2 c, and ... See full document
1
On the Super Spanning Properties of Binary Wrapped Buttefly Graphs
... terms, graphs and networks, inter- ...the wrapped butterfly network is very suitable for VLSI implementation and parallel computing and thus its topological properties have been widely dis- cussed ... See full document
18
The Study for Ring Embedding in Faulty Generalized Pancake Networks 賴盈志、洪春男
... pancake graphs, fault-tolerant embedding, Hamiltonian path, Hamiltonian cycle, Hamiltonian connected ...pancake graphs 的容錯性質 ...pancake graphs的容錯性質............. 7 第三章 研究n-dimensional ... See full document
2
Fault-free mutually independent Hamiltonian cycles of faulty star graphs
... of embedding exactly one Hamiltonian cycle into an injured star network, this paper addresses the maximum number of fault- free mutually independent Hamiltonian cycles in the faulty star ... See full document
18
Fault-tolerant cycle-embedding of crossed cubes
... 2003 Published by Elsevier B.V. Keywords: Cycle embedding; Crossed cube; Pancyclic; Hamiltonian; Fault tolerance 1. Introduction Network topology is essential for parallel and distributed computation, and ... See full document
6
Fault-tolerant ring embedding in faulty arrangement graphs
... cubes, and trees in arrangement graphs,” Proceed- ings of the International Conference on Parallel Processing, 1993, pp. Kanevsky, ”Embedding rings in recursive networks,” [r] ... See full document
6
Ring embedding in faulty honeycomb rectangular torus
... Hamiltonian cycle; Ring embedding ...proposed in the literature for the purpose of connecting a large number of processing elements ...placed in a square or rectangular grid and is connected ... See full document
8
Embedding cycles in IEH graphs
... Keywords: Hypercubes; Embedding; Hamiltonian cycles; Incrementally Extensible Hypercubes; Interconnection networks.. Introduction.[r] ... See full document
5
Edge-disjoint Undirected Spanning Trees on the Wrapped Butterfly Networks
... algorithms in distributed memory parallel computers. In this paper, we propose a formula for obtaining the maximum number of edge-disjoint undirected spanning trees on the wrapped butterfly ... See full document
6
The minimum spanner problem on butterfly graphs
... In [2], Harbane and Pa& constructed 3-spanners of the complete generalized p-cycle graphs, which represent a family of underlying graphs produced by the conjunction of [r] ... See full document
6
Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
... node. In this paper, under the conditional fault model and with the assumption of at least two fault-free links incident to each node, we show that an n-dimensional alternating group graph can tolerate up to 4n ... See full document
7
Longest ring and path embedding in faulty hypercube 蘇文彥、洪春男
... fault-free cycle with length at least 2n-2|Fv|+4 in Qn-Fv where Fv is the faulty vertices set contains at least two black vertices and two white vertices with ... See full document
2
Graph embedding aspect of IEH graphs
... hypercubes, embedding, binary trees, meshes, incrementally extensible hy- percubes, interconnection networks ...Hypercube graphs are one class among the most popular topologies for implement- ing massively ... See full document
11
Maximal independent sets in graphs with at most one cycle
... Jou, The Number of Maximal Independent Sets in Graphs, Master Thesis, Department of Mathematics, National Central University, Taiwan, 199 I. Liu, Maximal independent [r] ... See full document
7
相關主題