Y. Mao

activity

20122026

most citedOn extremal graphs with at most two internally disjoint Steiner trees connecting any three vertices

21 citations · 90 across the 38 of their papers we have counts for

collaborators

Showing 2016Show all

4 papers · 1 filter

math.CO2016

The minimal size of graphs with given pendant-tree connectivity

Yaping Mao

The concept of pendant-tree $k$ -connectivity $τ_{k} (G)$ of a graph $G$ , introduced by Hager in 1985, is a generalization of classical vertex-connectivity. Let $f (n, k, ℓ)$ be the mi…

math.CO2016

Pendant-tree connectivity of line graphs

Yaping Mao

The concept of pendant-tree connectivity, introduced by Hager in 1985, is a generalization of classical vertex-connectivity. In this paper, we study pendant-tree connectivity of li…

math.CO2016

Line k-Arboricity in Product Networks

Yaping Mao, Zhiwei Guo, Nan Jia +1

A \emph{linear $k$ -forest} is a forest whose components are paths of length at most $k$ . The \emph{linear $k$ -arboricity} of a graph $G$ , denoted by $la_{k} (G)$ , is the least n…

math.CO2016

Path connectivity of line graphs

Yaping Mao

Dirac showed that in a $(k - 1)$ -connected graph there is a path through each $k$ vertices. The path $k$ -connectivity $π_{k} (G)$ of a graph $G$ , which is a generalization of Dirac's no…