[PDF] Top 20 Cycle Embedding on the Edge Fault Star Graphs
Has 10000 "Cycle Embedding on the Edge Fault Star Graphs" found on our website. Below are the top 20 most common "Cycle Embedding on the Edge Fault Star Graphs".
Cycle Embedding on the Edge Fault Star Graphs
... Cycle Embedding on the Edge Fault Star Graphs Tseng-Kuei Li ∗ Abstract The star graph is one of the famous interconnection ...networks. ... See full document
9
Fault-Tolerant Embedding of Longest Paths in Star Graphs with Edge Faults
... from the longest fault-free path. Since an n-dimensional star graph is regular of degree n-1, |F e |=n-3 is maximum in the worst case, in order to embed a longest fault-free path ... See full document
31
Embedding Edge-Disjoint Spanning Trees on the Alternating Group Graphs
... of the maximum number of directed edge-disjoint spanning trees on the alternating group ...graph. The paths that route from the common root node to any given node through ... See full document
21
Hyper hamiltonian laceability on edge fault star graph
... of the multi-process com- puter systems. Graphs are usually used to represent the interconnection architecture of these systems, where vertices represent processors and edges represent links between ... See full document
13
Cycle embedding in faulty wrapped butterfly graphs
... Hamiltonian cycle; wrapped butterfly; fault-toler- ant; cycle embedding; Cayley graph ...INTRODUCTION The performance of a distributed system is significantly determined by its network ... See full document
12
Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model
... 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 Hamiltonian ... See full document
11
Fault Hamiltonicity and fault Hamiltonian connectivity of the (n, k)-star graphs
... Hamiltonian cycle; Hamiltonian connected; (n, k)- star graph ...INTRODUCTION The architecture of an interconnection network is usually represented by a ...designing the topology of ... See full document
13
Fault-tolerant cycle-embedding of crossed cubes
... Keywords: Cycle embedding; Crossed cube; Pancyclic; Hamiltonian; Fault tolerance ...butterfly graphs and star graphs. The hypercube is one of the most popular ... See full document
6
Hamiltonian-Laceability in Star Graphs with Conditional Edge Faults
... ABSTRACT The star graph S n possess many nice topological ...of the most versatile and efficient interconnection networks (networks for short) so far discovered for parallel ...computation. ... See full document
9
Fault-Free Ring Embedding in Faulty Wrapped Butterfly Graphs
... of the most promising networks due to its nice topological properties. On the other hand, cycle (ring) con- tains several attractive properties such as simplicity, exten- sibility, and ... See full document
4
Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
... that the faults might occur everywhere without any restriction, whereas the conditional fault model assumed that the distribution of faults was subject to some constraint, ...more ... See full document
7
Fault-free mutually independent Hamiltonian cycles of faulty star graphs
... 2010) The star graph interconnection network has been recognized as an attractive alternative to the hypercube for its nice topological ...concerning the issue of embedding exactly one ... See full document
18
Fault Diameter of the Cayley Graphs Based on the Alternating Group
... group graphs[8], introduced by Jwo, Lakshmivarahan and Dhall, are Cayley graphs based on the alternating ...group graphs are edge symmetry, 2-transitive, Hamiltonian and strongly ... See full document
6
Mutually independent hamiltonian cycles for the pancake graphs and the star graphs
... of the concept of mutually independent hamiltonian cycles Mutually independent hamiltonicity of graphs can be applied to many ...Consider the following ...However, the maximum number of people ... See full document
10
The Study of Adjacent Vertices Fault Tolerance Hamiltonian Laceability of Star Graphs 歐宗翰、洪春男
... The star graph is a famous interconnection ...investigate the edge fault tolerance and adjacent vertex fault tolerance for some Hamiltonian property of the star ... See full document
2
Fault-free Hamiltonian cycles in alternating group graphs with conditional edge faults
... Abstract. The alternating group graph, which belongs to the class of Cayley graphs, is one of the most versatile interconnection networks for parallel and distributed ...adopting the ... See full document
10
The study of the adjacent vertices fault-tolerance for two spannability of star graphs 塗博勳、洪春男
... Ring embedding in faulty star graphs,” IEICE ...“Cycle embedding in star graphs with more conditional faulty edges,” Applied Mathematics and Computation, 218, ... See full document
3
Adjacent vertices fault tolerance hamiltonian laceability of star graphs 楊俊彥、洪春男
... is the set of f ?(n?4) pairs of adjacent faulty vertices, Sn?F is Hamiltonian where F is the set of f ?(n?3) pairs of adjacent faulty ...is the set of f ?(n ?4) pairs of adjacent faulty ...construct ... See full document
2
Fault hamiltonicity and fault hamiltonian connectivity of the arrangement graphs
... OF THE A RRANGEMENT G RAPHS In this paper, we concentrate on loopless undirected ...For the graph definition and notation, we follow ...is the vertex set and E is the edge ... See full document
15
The Study of Edge Fault-Tolerance for Two Spanning Disjoint Paths of Star Networks 劉驥雷、洪春男
... variation on the hypercube with lower diameter”, IEEE Transactions on Computers, ...routing on hypercubes,” Journal of Combinatorial Theory, ...Longest Fault-Free Paths onto Star ... See full document
2
相關主題