J. Ai

activity

20182020

most citedProximity and Remoteness in Directed and Undirected Graphs

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

collaborators

3 papers

math.CO2020★ 1 cited

Proximity and Remoteness in Directed and Undirected Graphs

Jiangdong Ai, Stefanie Gerke, Gregory Gutin +1

Let $D$ be a strongly connected digraph. The average distance $σ ˉ (v)$ of a vertex $v$ of $D$ is the arithmetic mean of the distances from $v$ to all other vertices of $D$ . The r…

math.CO2019

Proper Orientation Number of Triangle-free Bridgeless Outerplanar Graphs

J. Ai, S. Gerke, G. Gutin +2

An orientation of $G$ is a digraph obtained from $G$ by replacing each edge by exactly one of two possible arcs with the same endpoints. We call an orientation \emph{proper} if nei…

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…