J. Ai

activity

20182026

most citedProximity and Remoteness in Directed and Undirected Graphs

1 citations · 1 across the 14 of their papers we have counts for

collaborators

Showing 2018Show all

2 papers · 1 filter

cs.DM2018

Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs

Yuefang Sun, Gregory Gutin, Jiangdong Ai

A digraph $D = (V, A)$ has a good decomposition if $A$ has two disjoint sets $A_{1}$ and $A_{2}$ such that both $(V, A_{1})$ and $(V, A_{2})$ are strong. Let $T$ be a digraph with $t$ vertices…

math.CO2018

k-Ary spanning trees contained in tournaments

Jiangdong Ai, Hui Lei, Yongtang Shi +2

A rooted tree is called a $k$ -ary tree, if all non-leaf vertices have exactly $k$ children, except possibly one non-leaf vertex has at most $k - 1$ children. Denote by $h (k)$ the min…