Shu-Li Zhao

collaborators

4 papers

math.CO2018

The $g$ -good neighbour diagnosability of hierarchical cubic networks

Shu-Li Zhao, Rong-Xia Hao

Let $G = (V, E)$ be a connected graph, a subset $S \subseteq V (G)$ is called an $R^{g}$ -vertex-cut of $G$ if $G - F$ is disconnected and any vertex in $G - F$ has at least $g$ neighbours…

math.CO2018

The generalized connectivity of some regular graphs

Shu-Li Zhao, Rong-Xia Hao

The generalized $k$ -connectivity $κ_{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 b…

math.CO2018

The generalized connectivity of $(n, k)$ -bubble-sort graphs

Shu-Li Zhao, Rong-Xia Hao, Lidong Wu

Let $S \subseteq V (G)$ and $κ_{G} (S)$ denote the maximum number $r$ of edge-disjoint trees $T_{1}, T_{2}, \dots, T_{r}$ in $G$ such that $V (T_{i}) ⋂ V (T_{j}) = S$ for any $i, j \in \{1,…

math.CO2018

Two kinds of generalized connectivity of dual cubes

Shu-Li Zhao, Rong-Xia Hao, Eddie Cheng

Let $S \subseteq V (G)$ and $κ_{G} (S)$ denote the maximum number $k$ of edge-disjoint trees $T_{1}, T_{2}, \dots, T_{k}$ in $G$ such that $V (T_{i}) ⋂ V (T_{j}) = S$ for any $i, j…

The g-good neighbour diagnosability of hierarchical cubic networks

The generalized connectivity of some regular graphs

The generalized connectivity of (n,k)-bubble-sort graphs

Two kinds of generalized connectivity of dual cubes

The $g$ -good neighbour diagnosability of hierarchical cubic networks

The generalized connectivity of $(n, k)$ -bubble-sort graphs