Ruijuan Li

According to our database, Ruijuan Li authored at least 28 papers between 2006 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

[k]-Roman Domination in Digraphs.

Xinhong Zhang, Xin Song, Ruijuan Li

Symmetry, February, 2023

2022

<i>In silico</i> genome mining of potential novel biosynthetic gene clusters for drug discovery from <i>Burkholderia</i> bacteria.

Khorshed Alam, Md. Mahmudul Islam, Kai Gong, Muhammad Nazeer Abbasi, Ruijuan Li, Youming Zhang, Aiying Li

Comput. Biol. Medicine, 2022

Elderly Nursing Monitoring System Based on DSP.

Jing Ye, Ruijuan Li, Min Zhang, Xingjun Wu, Qian Yang

Proceedings of the 4th International Conference on Artificial Intelligence and Advanced Manufacturing, 2022

2020

Vertex-disjoint cycles in local tournaments.

Ruijuan Li, Juanjuan Liang, Xinhong Zhang, Yubao Guo

Discret. Math., 2020

2019

The second neighbourhood for bipartite tournaments.

Ruijuan Li, Bin Sheng

Discuss. Math. Graph Theory, 2019

2018

Integrating Airborne LiDAR and Optical Data to Estimate Forest Aboveground Biomass in Arid and Semi-Arid Regions of China.

Luodan Cao, Jianjun Pan, Ruijuan Li, Jialin Li, Zhaofu Li

Remote. Sens., 2018

Arc-disjont Hamiltonian cycles in round decomposable locally semicomplete digraphs.

Tingting Han, Ruijuan Li

Discuss. Math. Graph Theory, 2018

The independence number of the competition graph of a bipartite tournament.

Ruijuan Li, Xiaoting An, Xinhong Zhang

Ars Comb., 2018

2017

Arc-disjoint hamiltonian paths in non-round decomposable local tournaments.

Ruijuan Li, Tingting Han

Discret. Math., 2017

The Euler and Chinese Postman Problems on 2-Arc-Colored Digraphs.

Bin Sheng, Ruijuan Li, Gregory Z. Gutin

CoRR, 2017

Seymour's second neighbourhood conjecture for quasi-transitive oriented graphs.

Gregory Z. Gutin, Ruijuan Li

CoRR, 2017

2016

The (1, 2)-step competition graph of a pure local tournament that is not round decomposable.

Xinhong Zhang, Ruijuan Li

Discret. Appl. Math., 2016

2015

Generalizing Vertex Pancyclic and k-ordered Graphs.

Ruijuan Li, Xinhong Zhang, Qiaoping Guo

Graphs Comb., 2015

2014

The H-force set of a hypertournament.

Ruijuan Li, Xinhong Zhang, Shengjia Li, Qiaoping Guo, Yubao Guo

Discret. Appl. Math., 2014

2013

A note on the existence of edges in the (1, 2)-step competition graph of a round digraph.

Xinhong Zhang, Ruijuan Li, Shengjia Li, Gaokui Xu

Australas. J Comb., 2013

A Fan-type degree condition for k-linked graphs.

Ruijuan Li, Michael Ferrara, Xinhong Zhang, Shengjia Li

Australas. J Comb., 2013

2012

The structure of 4-strong tournaments containing exactly three out-arc pancyclic vertices.

Qiaoping Guo, Shengjia Li, Ruijuan Li

J. Graph Theory, 2012

Pancyclic out-arcs of a vertex in oriented graphs.

Qiaoping Guo, Shengjia Li, Ruijuan Li, Gaokui Xu

Inf. Process. Lett., 2012

H-force sets of locally semicomplete digraphs.

Xinhong Zhang, Ruijuan Li, Shengjia Li

Discret. Appl. Math., 2012

2011

Hamilton Non-holonomic Momentum Equation of the System and Conclusions.

Hongfang Liu, Ruijuan Li, Nana Li

Proceedings of the Information Computing and Applications, 2011

Construction of Riemann-Theta Function Solutions for Benjamin-Ono Equation Based on Symbolic Computation.

Lei Yan, Ruijuan Li

Proceedings of the Advances in Computer Science, 2011

2010

A Fan-type result on k-ordered graphs.

Ruijuan Li

Inf. Process. Lett., 2010

Degree conditions on distance 2 vertices that imply k-ordered Hamiltonian.

Ruijuan Li, Shengjia Li, Yubao Guo

Discret. Appl. Math., 2010

2008

The number of vertices whose out-arcs are pancyclic in a 2-strong tournament.

Ruijuan Li, Shengjia Li, Jinfeng Feng

Discret. Appl. Math., 2008

2007

An efficient condition for a graph to be Hamiltonian.

Shengjia Li, Ruijuan Li, Jinfeng Feng

Discret. Appl. Math., 2007

The graphs satisfying conditions of Ore's type.

Shengjia Li, Ruijuan Li, Jinfeng Feng

Australas. J Comb., 2007

The number of vertices whose out-arcs are pancyclic in 2-strong tournaments.

Ruijuan Li, Shengjia Li, Jinfeng Feng

Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007

2006

An s-strong tournament with s>=3 has s+1 vertices whose out-arcs are 4-pancyclic.

Jinfeng Feng, Shengjia Li, Ruijuan Li

Discret. Appl. Math., 2006