J. Ai

activity

20182026

most citedProximity and Remoteness in Directed and Undirected Graphs

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

collaborators

Showing cs.DMShow all

2 papers · 1 filter

cs.DM2026

The Complexity of Mixed Arc-Disjoint Spanning Subdigraphs with Antistrong Connectivity

Jiangdong Ai, Gregory Gutin, Hui Lei +1

A trail is antidirected if its arcs alternate between forward and backward. A digraph $D$ is antistrong if, for every ordered pair of distinct vertices $x, y \in V (D)$ , it contains a…

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…