The reliability measure of networks is of significant importance to the design and maintenance of networks. Based on connectivity, many refined quantitative indicators for the reliability of network systems have been introduced. The super vertex edge-connectivity and cyclic edge-connectivity, as important parameters to evaluate the robustness of networks, are explored extensively. As a variant of the hypercube Qn, the varietal hypercube VQn has better properties than Qn with the same number of edges and vertices. Wang and Xu have proved that VQn is super vertex-connected for n≥1 and is also super edge-connected if n≠2. In this paper, we use another method to prove these results. Moreover, we also obtain the super restricted connectivity and...
In evaluating the fault tolerance of an interconnection network, it is essential to estimate the siz...
The connectivity of a graph is an important measurement for the fault-tolerance of the network. To p...
AbstractLet fe (respectively, fv) denote the number of faulty edges (respectively, vertices) of an n...
International audienceFor a graph $G$ and a non-negative integer $g$, the $g$-extra edge connectivit...
International audienceFor a graph $G$ and a non-negative integer $g$, the $g$-extra edge connectivit...
International audienceFor a graph $G$ and a non-negative integer $g$, the $g$-extra edge connectivit...
International audienceFor a graph $G$ and a non-negative integer $g$, the $g$-extra edge connectivit...
Mass data processing and complex problem solving have higher and higher demands for performance of m...
13th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW) -- MAY 26-28, 2015 -- Oz...
AbstractA graph is said to be super-connected if every minimum vertex cut isolates a vertex. A graph...
The connectivity is an important measurement for the fault tolerance of a network. Let G=VG,EG be a ...
The reliability of an interconnection network is an important issue for multiprocessor systems. We k...
When a network begins losing nodes or links, there might be a loss of its effectiveness. Therefore c...
AbstractA vertex subset F is an Rg-cut of a connected graph G if G−F is disconnected and every verte...
AbstractA vertex subset F is an Rg-cut of a connected graph G if G−F is disconnected and every verte...
In evaluating the fault tolerance of an interconnection network, it is essential to estimate the siz...
The connectivity of a graph is an important measurement for the fault-tolerance of the network. To p...
AbstractLet fe (respectively, fv) denote the number of faulty edges (respectively, vertices) of an n...
International audienceFor a graph $G$ and a non-negative integer $g$, the $g$-extra edge connectivit...
International audienceFor a graph $G$ and a non-negative integer $g$, the $g$-extra edge connectivit...
International audienceFor a graph $G$ and a non-negative integer $g$, the $g$-extra edge connectivit...
International audienceFor a graph $G$ and a non-negative integer $g$, the $g$-extra edge connectivit...
Mass data processing and complex problem solving have higher and higher demands for performance of m...
13th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW) -- MAY 26-28, 2015 -- Oz...
AbstractA graph is said to be super-connected if every minimum vertex cut isolates a vertex. A graph...
The connectivity is an important measurement for the fault tolerance of a network. Let G=VG,EG be a ...
The reliability of an interconnection network is an important issue for multiprocessor systems. We k...
When a network begins losing nodes or links, there might be a loss of its effectiveness. Therefore c...
AbstractA vertex subset F is an Rg-cut of a connected graph G if G−F is disconnected and every verte...
AbstractA vertex subset F is an Rg-cut of a connected graph G if G−F is disconnected and every verte...
In evaluating the fault tolerance of an interconnection network, it is essential to estimate the siz...
The connectivity of a graph is an important measurement for the fault-tolerance of the network. To p...
AbstractLet fe (respectively, fv) denote the number of faulty edges (respectively, vertices) of an n...