Fankang He

most citedA complete characterization of split digraphs with a strong arc decomposition

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

collaborators

3 papers

math.CO2024★ 1 cited

A complete characterization of split digraphs with a strong arc decomposition

Jiangdong Ai, Fankang He, Zhaoxiang Li +2

A \textbf{strong arc decomposition} of a (multi-)digraph $D (V, A)$ is a partition of its arc set $A$ into two disjoint arc sets $A_{1}$ and $A_{2}$ such that both of the spanning subdi…

math.CO2024

On degree power sum in $P_{k}$ -free graphs

Jiangdong Ai, Fankang He, Yihang Liu +1

Let $G$ be a graph on $n$ vertices with degree sequence $(d_{1}, d_{2} ...... d_{n})$ . For a real $p \geq 1$ , let $D_{p} (G) = \sum_{i = 1}^{n} d_{i}^{p}$ . A Turán-type problem of degree power sum was in…

math.CO2024

Solution on strong partition of $2$ -balanced regular multipartite tournaments

Jiangdong Ai, Fankang He, Yihang Liu

We call a partition of a $c$ -partite tournament into tournaments of order $c$ is strong if each tournament is strongly connected. The strong partition number denoted as $S T (r)$ , re…

A complete characterization of split digraphs with a strong arc decomposition

On degree power sum in Pk​-free graphs

Solution on strong partition of 2-balanced regular multipartite tournaments

On degree power sum in $P_{k}$ -free graphs

Solution on strong partition of $2$ -balanced regular multipartite tournaments