منابع مشابه
The vulnerability of the diameter of enhanced hypercubes
For an interconnection network G, the ω-wide diameter dω(G) is the least l such that any two vertices are joined by ω internally-disjoint paths of length at most l, and the (ω − 1)-fault diameter Dω(G) is the maximum diameter of a subgraph obtained by deleting fewer than ω vertices of G. The enhanced hypercube Qn,k is a variant of the well-known hypercube. Yang, Chang, Pai, and Chan gave an upp...
متن کاملThe vulnerability of the diameter of the enhanced hypercubes
Article history: Received 6 April 2017 Received in revised form 13 June 2017 Accepted 3 July 2017 Available online xxxx Communicated by S.-Y. Hsieh
متن کاملDiameter variability of cycles and tori
The diameter of a graph is an important factor for communication as it determines the maximum communication delay between any pair of processors in a network. Graham and Harary [N. Graham, F. Harary, Changing and unchanging the diameter of a hypercube, Discrete Applied Mathematics 37/38 (1992) 265–274] studied how the diameter of hypercubes can be affected by increasing and decreasing edges. Th...
متن کاملRemoving edges from hypercubes to obtain vertex-symmetric networks with small diameter
The binary hypercube Qn has small diameter, but a relatively large number of links. Because of this, efforts have been made to determine the maximum number of links that can be deleted without increasing the diameter. However, the resulting networks are not vertex-symmetric. We propose a family of vertex-symmetric spanning subnetworks of Qn, whose diameter differs from that of Qn by only a smal...
متن کاملFourier versus Wavelet Analysis of Solar Diameter Variability
7 Fig. 9. Result of the wavelet transform inversion with 3-level in solid line with the errors bars of the original data.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.04.033