Q. Yang

activity

20162023

most citedFog Data: Enhancing Telehealth Big Data Through Fog Computing

91 citations · 125 across the 16 of their papers we have counts for

collaborators

Showing 2022Show all

2 papers · 1 filter

math.CO2022

Proof a conjecture on connectivity keeping odd paths in k-connected bipartite graphs

Qing Yang, Yingzhi Tian

Luo, Tian and Wu (2022) conjectured that for any tree $T$ with bipartition $X$ and $Y$ , every $k$ -connected bipartite graph $G$ with minimum degree at least $k + t$ , where $t =$ max$\{…

math.CO2022

Connectivity keeping caterpillars and spiders in bipartite graphs with connectivity at most three

Qing Yang, Yingzhi Tian

A conjecture of Luo, Tian and Wu (2022) says that for every positive integer $k$ and every finite tree $T$ with bipartition $X$ and $Y$ (denote $t = max {∣ X ∣, ∣ Y ∣})$ , every $k$ -c…