45,871 research outputs found
Super edge-connectivity and matching preclusion of data center networks
Edge-connectivity is a classic measure for reliability of a network in the
presence of edge failures. -restricted edge-connectivity is one of the
refined indicators for fault tolerance of large networks. Matching preclusion
and conditional matching preclusion are two important measures for the
robustness of networks in edge fault scenario. In this paper, we show that the
DCell network is super- for and ,
super- for and , or and , and
super- for and . Moreover, as an application of
-restricted edge-connectivity, we study the matching preclusion number and
conditional matching preclusion number, and characterize the corresponding
optimal solutions of . In particular, we have shown that is
isomorphic to the -star graph for .Comment: 20 pages, 1 figur
Iterative Universal Rigidity
A bar framework determined by a finite graph and configuration in
space is universally rigid if it is rigid in any . We provide a characterization of universally rigidity for any
graph and any configuration in terms of a sequence of affine
subsets of the space of configurations. This corresponds to a facial reduction
process for closed finite dimensional convex cones.Comment: 41 pages, 12 figure
- …