[PDF] Top 20 On the spanning w-wide diameter of the star graph
Has 10000 "On the spanning w-wide diameter of the star graph" found on our website. Below are the top 20 most common "On the spanning w-wide diameter of the star graph".
On the spanning w-wide diameter of the star graph
... connects the processors of parallel ...a graph, in which the nodes correspond to processors and the edges correspond to ...designing the topology for computer networks. ... See full document
15
On the number of spanning trees of a multi-complete/star related graph
... On the number of spanning trees of a multi-complete/star related graph Kuo-Liang Chung a,∗ , Wen-Ming Yan b,1 a Department of Information Management, Institute ... See full document
7
A formula for the number of spanning trees of a multi-star related graph
... Our new labeling method transforms the complement spanning tree matrix G into matrix whose left-upper submatrix is an identity matrix and whose right-lower submatr[r] ... See full document
4
Fault Diameter of the Cayley Graphs Based on the Alternating Group
... based on the alternating ...embedding of a class of multidimensional grids with unit expansion and dilation three and embedding of a variety of cycles with unit ...dilation. ... See full document
6
On the spanning connectivity and spanning laceability of hypercube-like networks
... 0 Graph containers do exist in engineering design information and telecommunication networks or in biological and neural systems ([2,12] and its ...references). The study of w-container, ... See full document
12
The super spanning connectivity and super spanning laceability of the enhanced hypercubes
... super spanning laceable. All bipartite hypercube-like graphs are super spanning laceable ...[14]. The n-dimensional star graph S n is super spanning laceable if and only if n = ... See full document
22
The Study of Edge Fault-Tolerance for Two Spanning Disjoint Paths of Star Networks 劉驥雷、洪春男
... The star graph is a famous interconnection ...discuss the edge fault tolerance for 2-pair spanning property for star ...be the n-dimensional star ...two ... See full document
2
On the Optimum Requirement Graph Problem
... a spanning tree balanc- ing the minimum spanning tree and the short-path tree of a specified ...node. The NP-hardness of find- ing the minimum diameter ... See full document
5
The spanning laceability on the faulty bipartite hypercube-like networks
... Basic graph definitions and notations The research about interconnection networks is important for parallel and distributed computer ...systems. The layouts of processors and links in ... See full document
9
Topological Properties on the Wide and Fault Diameters of Exchanged Hypercubes
... in the fact that even though the number of edges of an exchanged hypercube is nearly half of that of a hypercube, their diameters are ...between the two ...to the ... See full document
11
Embedding Edge-Disjoint Spanning Trees on the Alternating Group Graphs
... than the lower ...algorithm on alternating group ...set of edge-disjoint paths between any two ...that the fault diameter of an alternating group graph is no more ... See full document
21
Embed a Longest Path between Arbitrary Two Vertices of a Faulty Star Graph
... networks. The problems of diameter [29], routing [14, 35], multicasting [22], broadcasting [34], gossiping [13], embedding [11, 30, 36], and fault-tolerant graphs [6−9, 20] have been solved on ... See full document
29
THE (N,K)-STAR GRAPH - A GENERALIZED STAR GRAPH
... The routing from an arbitrary node p to the iden- tity node lk can be achieved by moving internal sym- bols to their correct positions and exchanging exter- na[r] ... See full document
6
On the height of independent spanning trees of a k-connected k-regular graph
... +RZHYHU ,W UHPDLQV XQNQRZQ ZKHWKHU WKHUH LV D SRO\QRPLDO WLPH DOJRULWKP IRU UHGXFLQJ WKH KHLJKW RI N LQGHSHQGHQW VSDQQLQJ WUHHV WR D PLQLPXP H[WHQW ,W DOVR UHPDLQV XQNQRZQ ZKHWKHU WKHUH LV DQ HIILFLHQW ... See full document
6
Reconstruction of the Sturm-Liouville Operator on a -star Graph with Nodal Data
... with the inverse problem of reconstructing the Sturm- Liouville operator defined on a p-star ...subset of nodal data can uniquely determine the boundary conditions and ... See full document
19
On the spanning fan-connectivity of graphs
... Department of Computer Science, National Chiao Tung University, Hsinchu, 30010, Taiwan, ROC b Department of Computer and Information Science, Fordham University, New York, NY 10023, USA c Department ... See full document
7
Hyper hamiltonian laceability on edge fault star graph
... subject of the multi-process com- puter ...represent the interconnection architecture of these systems, where vertices represent processors and edges represent links between ...concerned ... See full document
13
On the arrangement graph
... Even before [8] was published, Day and Tripathi [5] proposed a generalized star graph, called the arrange- ment graph, as an attractive interconnection scheme for[r] ... See full document
5
The application of blending law on linear viscoelastic properties of linear?star and star?star polymer blends
... results of the steady-state recoverable compliance, J o e b of the blends is showed in ...with the increasing volume fraction of long-arm star components, v 2 , then ... See full document
9
On the Super Spanning Properties of Binary Wrapped Buttefly Graphs
... use the terms, graphs and networks, inter- changeably. Among various kinds of network topolo- gies, the wrapped butterfly network is very suitable for VLSI implementation and parallel computing and ... See full document
18
相關主題