Name
Abstract | ||
|---|---|---|
The generalized $k$-connectivity 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 a generalization of traditional connectivity. Let $S\subseteq V(G)$ and $\kappa _{G}(S)$ denote the maximum number $r$ of edge-disjoint trees $T_{1}, T_{2}, \cdots , T_{r}$ in $G$ such that $V(T_{i})\bigcap V(T_{j})=S$ for any $i, j \in \{1, ... |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1093/comjnl/bxz116 | The Computer Journal |
Keywords | DocType | Volume |
interconnection network,generalized connectivity,fault-tolerance,internally disjoint trees | Journal | 64 |
Issue | ISSN | Citations |
1 | 0010-4620 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shu-Li Zhao | 1 | 1 | 4.40 |
| Rongxia Hao | 2 | 165 | 26.11 |
| Sheng-Lung Peng | 3 | 0 | 0.34 |