Juan Liu

Orcid: 0000-0003-0857-3877

Affiliations:
  • Xinjiang University, College of Mathematics Sciences, Urumqi, China


According to our database1, Juan Liu authored at least 36 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Symmetric cores and extremal size bound for supereulerian semicomplete bipartite digraphs.
Discret. Math., April, 2024

Antidirected spanning closed trail in tournaments.
Appl. Math. Comput., February, 2024

Dominated pair degree sum conditions of supereulerian digraphs.
Discuss. Math. Graph Theory, 2024

2022
Trail-Connected Digraphs with Given Local Structures.
J. Interconnect. Networks, 2022

Hamiltonian index of directed multigraph.
Appl. Math. Comput., 2022

2021
Symmetric core and spanning trails in directed networks.
Discret. Math., 2021

Matching and spanning trails in digraphs.
Discret. Appl. Math., 2021

Numerical study of Fisher's equation by the RBF-FD method.
Appl. Math. Lett., 2021

Trail-connected tournaments.
Appl. Math. Comput., 2021

Sufficient Ore type condition for a digraph to be supereulerian.
Appl. Math. Comput., 2021

2020
Supereulerian 3-path-quasi-transitive digraphs.
Appl. Math. Comput., 2020

2018
Supereulerian bipartite digraphs.
J. Graph Theory, 2018

Supereulerian digraphs with given diameter.
Appl. Math. Comput., 2018

2016
Supereulerian digraphs with given local structures.
Inf. Process. Lett., 2016

2015
Domination in lexicographic product digraphs.
Ars Comb., 2015

2014
The domination number of Strong Product of Directed cycles.
Discret. Math. Algorithms Appl., 2014

On strongly Z<sub>2s-1</sub>-connected graphs.
Discret. Appl. Math., 2014

Local-restricted-edge-connectivity of graphs.
Ars Comb., 2014

2013
Analysis for one-dimensional time-fractional Tricomi-type equations by LDG methods.
Numer. Algorithms, 2013

2012
λ-Optimality of Bipartite Digraphs.
Inf. Process. Lett., 2012

The Properties of Transformation Digraphs D<sup>xyz</sup>.
Ars Comb., 2012

The Transformation Digraph D<sup>++-</sup>.
Ars Comb., 2012

Domination number in iterated line digraph of a complete bipartite digraph.
Ars Comb., 2012

2011
On domination number of Cartesian product of directed paths.
J. Comb. Optim., 2011

Total restrained domination in graphs.
Comput. Math. Appl., 2011

Domination in lexicographic product graphs.
Ars Comb., 2011

The Properties of Middle Digraphs.
Ars Comb., 2011

2010
Domination number of Cartesian products of directed cycles.
Inf. Process. Lett., 2010

On domination number of Cartesian product of directed cycles.
Inf. Process. Lett., 2010

Double-super-connected digraphs.
Discret. Appl. Math., 2010

2009
The bondage number in complete t-partite digraphs.
Inf. Process. Lett., 2009

Super restricted edge connected Cartesian product graphs.
Inf. Process. Lett., 2009

The restricted arc connectivity of Cartesian product digraphs.
Inf. Process. Lett., 2009

A line digraph of a complete bipartite digraph.
Appl. Math. Lett., 2009

2008
Super-connected and super-arc-connected Cartesian product of digraphs.
Inf. Process. Lett., 2008

Super-Arc-Connected and Super-Connected Total Digraphs.
Ars Comb., 2008


  Loading...