Yan Zhao

activity

20122026

most citedOn (strong) proper vertex-connection of graphs

2 citations · 7 across the 12 of their papers we have counts for

collaborators

Showing 2013 · math.COShow all

5 papers · 2 filters

math.CO2013★ 1 cited

Graphs with $4$ -rainbow index $3$ and $n - 1$

Xueliang Li, Ingo Schiermeyer, Kang Yang +1

Let $G$ be a nontrivial connected graph with an edge-coloring $c : E (G) \to {1, 2, \dots, q},$ $q \in N$ , where adjacent edges may be colored the same. A tree $T$ in $…

math.CO2013

Characterize graphs with rainbow connection number $m - 2$ and $m - 3$

Xueliang Li, Yuefang Sun, Yan Zhao

A path in an edge-colored graph, where adjacent edges may be colored the same, is a rainbow path if no two edges of it are colored the same. A nontrivial connected graph $G$ is rai…

math.CO2013★ 1 cited

Graphs with 3-rainbow index $n - 1$ and $n - 2$

Xueliang Li, Kang Yang, Yan Zhao

Let $G$ be a nontrivial connected graph with an edge-coloring $c : E (G) \to {1, 2, \dots, q},$ $q \in N$ , where adjacent edges may be colored the same. A tree $T$ in $…

math.CO2013

The 3-rainbow index of a graph

Lily Chen, Xueliang Li, Kang Yang +1

Let $G$ be a nontrivial connected graph with an edge-coloring $c : E (G) \to {1, 2, ..., q},$ $q \in N$ , where adjacent edges may be colored the same. A tree $T$ in $G…

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.…

Graphs with 4-rainbow index 3 and n−1

Characterize graphs with rainbow connection number m−2 and m−3

Graphs with 3-rainbow index n−1 and n−2

The 3-rainbow index of a graph

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

Graphs with $4$ -rainbow index $3$ and $n - 1$

Characterize graphs with rainbow connection number $m - 2$ and $m - 3$

Graphs with 3-rainbow index $n - 1$ and $n - 2$

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