4 citations · 4 across the 5 of their papers we have counts for
4 papers · 1 filter
The second out-neighbourhood for local tournaments
Ruijuan Li, Juanjuan Liang
Sullivan stated the conjectures: (1) every oriented graph has a vertex such that ; (2) every oriented graph has a vertex such that $d^{++}(x…
The (1,2)-step competition graph of a hypertournament
Ruijuan Li, Xiaoting An, Xinhong Zhang
Competition graphs were created in connected to a biological model as a means of reflecting the competition relations among the predators in the food webs and determining the small…
The H-force sets of the graphs satisfying the condition of Ore's theorem
Xinhong Zhang, Ruijuan Li
Let be a Hamiltonian graph with vertices. A nonempty vertex set is called a Hamiltonian cycle enforcing set (in short, an -force set) of if every $…
On kernels by rainbow paths in arc-coloured digraphs
Ruijuan Li, Yanqin Cao
In 2018, Bai, Fujita and Zhang (\emph{Discrete Math.} 2018, 341(6): 1523-1533) introduced the concept of a kernel by rainbow paths (for short, RP-kernel) of an arc-coloured digraph…