Leyou Xu

collaborators

4 papers

cs.SI2023

Link residual closeness of graphs with fixed parameters

Leyou Xu, Chengli Li, Bo Zhou

Link residual closeness is a newly proposed measure for network vulnerability. In this model, vertices are perfectly reliable and the links fail independently of each other. It mea…

math.CO2023

Toughness and existence of $2$ -factors

Leyou Xu, Bo Zhou

A graph is $t$ -tough if the deletion of any set of, say, $m$ vertices from the graph leaves a graph with at most $\frac{m}{t}$ components. In 1973, Chvátal suggested the problem of…

math.CO2023

The generalized $4$ -connectivity of bubble-sort graphs

Leyou Xu, Bo Zhou

For $S \subseteq V (G)$ with $∣ S ∣ \geq 2$ , let $κ_{G} (S)$ denote the maximum number of internally disjoint trees connecting $S$ in $G$ . For $2 \leq k \leq n$ , the generalized $k$ -connectivi…

math.CO2023

Hamiltonicity of $1$ -tough $(P_{2} \cup k P_{1})$ -free graphs

Leyou Xu, Chengli Li, Bo Zhou

Given a graph $H$ , a graph $G$ is $H$ -free if $G$ does not contain $H$ as an induced subgraph. For a positive real number $t$ , a non-complete graph $G$ is said to be $t$ -tough if f…

Link residual closeness of graphs with fixed parameters

Toughness and existence of 2-factors

The generalized 4-connectivity of bubble-sort graphs

Hamiltonicity of 1-tough (P2​∪kP1​)-free graphs

Toughness and existence of $2$ -factors

The generalized $4$ -connectivity of bubble-sort graphs

Hamiltonicity of $1$ -tough $(P_{2} \cup k P_{1})$ -free graphs