Chengli Li

collaborators

3 papers

math.CO2024

The maximum number of cliques in graphs with given fractional matching number and minimum degree

Chengli Li, Yurui Tang

Recently, Ma, Qian and Shi determined the maximum size of an $n$ -vertex graph with given fractional matching number $s$ and maximum degree at most $d$ . Motivated by this result, we…

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

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…

The maximum number of cliques in graphs with given fractional matching number and minimum degree

Link residual closeness of graphs with fixed parameters

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

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