相关论文: The structure connectivity of Data Center Networks

The connectivity is an important parameter to evaluate the robustness of a network. As a generalization, structure connectivity and substructure connectivity of graphs were proposed. For connected graphs $G$ and $H$, the $H$-structure…

The connectivity of a network directly signifies its reliability and fault-tolerance. Structure and substructure connectivity are two novel generalizations of the connectivity. Let $H$ be a subgraph of a connected graph $G$. The structure…

Let $ H $ be a connected subgraph of a graph $ G $. The structure connectivity of $ G $, denoted by $ \kappa(G;H) $, is the minimum number of a set of connected subgraphs in $ G $, whose removal disconnects $ G $ and each element in the set…

As a generalization of vertex connectivity, for connected graphs $G$ and $T$, the $T$-structure connectivity $\kappa(G, T)$ (resp. $T$-substructure connectivity $\kappa^{s}(G, T)$) of $G$ is the minimum cardinality of a set of subgraphs $F$…

The generalized $k$-connectivity $\kappa_{k}(G)$ of a graph $G$ is a parameter that can measure the reliability of a network $G$ to connect any $k$ vertices in $G$, which is proved to be NP-complete for a general graph $G$. Let $S\subseteq…

Hypercube is one of the most important networks to interconnect processors in multiprocessor computer systems. Different kinds of connectivities are important parameters to measure the fault tolerability of networks. Lin et…

Let $S\subseteq V(G)$ and $\kappa_{G}(S)$ denote the maximum number $k$ of edge-disjoint trees $T_{1}, T_{2}, \cdots, T_{k}$ in $G$ such that $V(T_{i})\bigcap V(T_{j})=S$ for any $i, j \in \{1, 2, \cdots, k\}$ and $i\neq j$. For an integer…

Let $G$ be a graph and $T$ a certain connected subgraph of $G$. The $T$-structure connectivity $\kappa(G; T)$ (or resp., $T$-substructure connectivity $\kappa^{s}(G; T)$) of $G$ is the minimum number of a set of subgraphs…

The data center networks $D_{n,k}$, proposed in 2008, has many desirable features such as high network capacity. A kind of generalization of diagnosability for network $G$ is $g$-good-neighbor diagnosability which is denoted by $t_g(G)$.…

In this paper, we mainly investigate $K_{1,2}$-structure-connectivity for any connected graph. Let $G$ be a connected graph with $n$ vertices, we show that $\kappa(G; K_{1,2})$ is well-defined if $diam(G)\geq 4$, or $n\equiv 1\pmod 3$, or…

Structure connectivity and substructure connectivity are innovative indicators for assessing network reliability and fault tolerance. Similarly, fault diameter evaluates fault tolerance and transmission delays in networks. This paper…

The component connectivity is the generalization of connectivity which is an parameter for the reliability evaluation of interconnection networks. The $g$-component connectivity $c\kappa_{g}(G)$ of a non-complete connected graph $G$ is the…

For an integer $\ell\geqslant 2$, the $\ell$-component connectivity of a graph $G$, denoted by $\kappa_{\ell}(G)$, is the minimum number of vertices whose removal from $G$ results in a disconnected graph with at least $\ell$ components or a…

Let $G$ be a nontrivial connected graph of order $n$ and let $k$ be an integer with $2\leq k\leq n$. For a set $S$ of $k$ vertices of $G$, let $\kappa (S)$ denote the maximum number $\ell$ of edge-disjoint trees $T_1,T_2,...,T_\ell$ in $G$…

Let $G$ be a nontrivial connected graph of order $n$ and $k$ an integer with $2\leq k\leq n$. For a set $S$ of $k$ vertices of $G$, let $\kappa (S)$ denote the maximum number $\ell$ of edge-disjoint trees $T_1,T_2,...,T_\ell$ in $G$ such…

The generalized $k$-connectivity of a graph $G$, denoted by $\kappa_k(G)$, is the minimum number of internally edge disjoint $S$-trees for any $S\subseteq V(G)$ with $|S|=k$. The generalized $k$-connectivity is a natural extension of the…

The connectivity of a graph is an important parameter to evaluate its reliability. $k$-restricted connectivity (resp. $R^h$-restricted connectivity) of a graph $G$ is the minimum cardinality of a set $S$ of vertices in $G$, if exists, whose…

Connectivity and diagnosability are two important parameters for the fault tolerant of an interconnection network $G$. In 1996, F\`{a}brega and Fiol proposed the $g$-extra connectivity of $G$. A subset of vertices $S$ is said to be a…

Fault tolerance of an $(n,k)$-star network is measured by its $h$-super connectivity $\kappa_s^{(h)}$ or $h$-super edge-connectivity $\lambda_s^{(h)}$. Li {\it et al.} [Appl. Math. Comput. 248 (2014), 525-530; Math. Sci. Lett. 1 (2012),…

With graphs considered as natural models for many network design problems, edge connectivity $\kappa'(G)$ and maximum number of edge-disjoint spanning trees $\tau(G)$ of a graph $G$ have been used as measures for reliability and strength in…