Yan Zhao

activity

20132020

most citedOn extremal graphs with exactly one Steiner tree connecting any

k

vertices

2 citations · 4 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2020

Note on Path-Connectivity of Complete Bipartite Graphs

Shasha Li, Yan Zhao

For a graph $G = (V, E)$ and a set $S \subseteq V (G)$ of size at least $2$ , a path in $G$ is said to be an $S$ -path if it connects all vertices of $S$ . Two $S$ -paths $P_{1}$ and $P_{2}$ ar…

math.CO2015★ 2 cited

On (strong) proper vertex-connection of graphs

Hui Jiang, Xueliang Li, Yingying Zhang +1

A path in a vertex-colored graph is a {\it vertex-proper path} if any two internal adjacent vertices differ in color. A vertex-colored graph is {\it proper vertex $k$ -connected} if…

math.CO2013★ 2 cited

On extremal graphs with exactly one Steiner tree connecting any $k$ vertices

Xueliang Li, Yan Zhao

The problem of determining the largest number $f (n; κ ˉ \leq ℓ)$ of edges for graphs with $n$ vertices and maximal local connectivity at most $ℓ$ was considered by Bollobás.…