6 papers
A short note on spanning even trees
Jiangdong Ai, Zhipeng Gao, Xiangzhou Liu +1
We call a tree is \emph{even} if every pair of its leaves is joined by a path of even length. Jackson and Yoshimoto~[J. Graph Theory, 2024] conjectured that every -regular n…
On degree power sum in -free graphs
Jiangdong Ai, Fankang He, Yihang Liu +1
Let be a graph on vertices with degree sequence . For a real , let . A Turán-type problem of degree power sum was in…
Piercing independent sets in graphs without large induced matching
Jiangdong Ai, Hong Liu, Zixiang Xu +1
Given a graph , denote by the smallest size of a subset of which intersects every maximum independent set of . We prove that any graph without induced match…
Solution on strong partition of -balanced regular multipartite tournaments
Jiangdong Ai, Fankang He, Yihang Liu
We call a partition of a -partite tournament into tournaments of order is strong if each tournament is strongly connected. The strong partition number denoted as , re…
Bounds on Maximum Weight Directed Cut
Jiangdong Ai, Stefanie Gerke, Gregory Gutin +2
We obtain lower and upper bounds for the maximum weight of a directed cut in the classes of weighted digraphs and weighted acyclic digraphs as well as in some of their subclasses.…
Results on the Small Quasi-Kernel Conjecture
Jiangdong Ai, Stefanie Gerke, Gregory Gutin +2
A {\em quasi-kernel} of a digraph is an independent set such that for every vertex , there exists a directed path with one or two arcs…