default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJuan Liu 0001
Person information
- affiliation: Xinjiang University, College of Mathematics Sciences, Urumqi, China
Other persons with the same name
- Juan Liu — disambiguation page
- Juan Liu 0002
![[0000-0003-3402-3123]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0003-3402-3123")
— Ningbo University, College of Electrical Engineering and Computer Science, Zhejiang, China (and 3 more) - Juan Liu 0003 — Xiamen University, Institute of Physical and Mechanical and Electrical Engineering, China (and 1 more)
- Juan Liu 0004 — Bengbu College, Department of Mathematics and Physics, China
- Juan Liu 0005 — Jinan University, Department of Mathematics, Guangzhou, China
- Juan Liu 0006 — Chinese Academy of Sciences, Academy of Mathematics and Systems Science, Beijing, China
- Juan Liu 0007 (aka: Juliet Juan Liu) — Wuhan University, School of Computer Science, Institute of Artificial Intelligence, China
- Juan Liu 0008 — Shandong University, College of Software, School of Computer Science and Technology, China (and 1 more)
- Juan Liu 0009 — Google Inc, New York, NY, USA (and 1 more)
- Juan Liu 0010 — Nanchang Hangkong University, Key Laboratory of Opto-Electronic Information Science and Technology of Jiangxi Province, China (and 1 more)
- Juan Liu 0011 — Tongji University, School of Electronics and Information Engineering, Shanghai, China
- Juan Liu 0012 — Palo Alto Research Center, CA, USA (and 1 more)
- Juan Liu 0013 — DOCOMO Beijing Communications Laboratories Company, Ltd., Beijing, China (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j36]Hong Yang, Juan Liu, Jixiang Meng:
Antidirected spanning closed trail in tournaments. Appl. Math. Comput. 462: 128336 (2024)- [j35]Juan Liu, Hong Yang, Xindong Zhang, Hong-Jian Lai:
Symmetric cores and extremal size bound for supereulerian semicomplete bipartite digraphs. Discret. Math. 347(4): 113867 (2024) - [j34]Changchang Dong, Jixiang Meng, Juan Liu:
Dominated pair degree sum conditions of supereulerian digraphs. Discuss. Math. Graph Theory 44(3): 879 (2024) - 2022
- [j33]Juan Liu, Shupeng Li, Xindong Zhang, Hong-Jian Lai:
Hamiltonian index of directed multigraph. Appl. Math. Comput. 425: 127074 (2022) - [j32]Juan Liu, Hong Yang, Hong-Jian Lai, Xindong Zhang:
Trail-Connected Digraphs with Given Local Structures. J. Interconnect. Networks 22(1): 2142016:1-2142016:11 (2022) - 2021
- [j31]Juan Liu, Qinghai Liu, Xindong Zhang, Xing Chen:
Trail-connected tournaments. Appl. Math. Comput. 389: 125595 (2021) - [j30]Changchang Dong, Jixiang Meng, Juan Liu:
Sufficient Ore type condition for a digraph to be supereulerian. Appl. Math. Comput. 410: 126470 (2021) - [j29]Xindong Zhang, Lin Yao, Juan Liu:
Numerical study of Fisher's equation by the RBF-FD method. Appl. Math. Lett. 120: 107195 (2021) - [j28]Juan Liu, Omaema Lasfar, Jia Wei, Xindong Zhang, Hong-Jian Lai:
Matching and spanning trails in digraphs. Discret. Appl. Math. 304: 417-431 (2021) - [j27]Juan Liu, Hong Yang, Hong-Jian Lai, Xindong Zhang:
Symmetric core and spanning trails in directed networks. Discret. Math. 344(11): 112584 (2021) - 2020
- [j26]Changchang Dong, Juan Liu, Jixiang Meng:
Supereulerian 3-path-quasi-transitive digraphs. Appl. Math. Comput. 372 (2020)
2010 – 2019
- 2018
- [j25]Changchang Dong, Juan Liu, Xindong Zhang:
Supereulerian digraphs with given diameter. Appl. Math. Comput. 329: 5-13 (2018) - [j24]Xindong Zhang, Juan Liu, Lan Wang, Hong-Jian Lai:
Supereulerian bipartite digraphs. J. Graph Theory 89(1): 64-75 (2018) - 2016
- [j23]Mansour J. Algefari, Khalid A. Alsatami, Hong-Jian Lai, Juan Liu:
Supereulerian digraphs with given local structures. Inf. Process. Lett. 116(5): 321-326 (2016) - 2015
- [j22]Juan Liu, Xindong Zhang, Jixiang Meng:
Domination in lexicographic product digraphs. Ars Comb. 120: 23-32 (2015) - 2014
- [j21]Juan Liu, Xindong Zhang, Jixiang Meng:
Local-restricted-edge-connectivity of graphs. Ars Comb. 113: 97-104 (2014) - [j20]Hong-Jian Lai, Yanting Liang, Juan Liu, Jixiang Meng, Zhengke Miao, Yehong Shao, Zhao Zhang:
On strongly Z2s-1-connected graphs. Discret. Appl. Math. 174: 73-80 (2014) - [j19]Huiping Cai, Juan Liu, Lingzhi Qian:
The domination number of Strong Product of Directed cycles. Discret. Math. Algorithms Appl. 6(2) (2014) - 2013
- [j18]Xindong Zhang, Juan Liu, Juan Wen, Bo Tang, Yinnian He:
Analysis for one-dimensional time-fractional Tricomi-type equations by LDG methods. Numer. Algorithms 63(1): 143-164 (2013) - 2012
- [j17]Xiujuan Zhang, Juan Liu, Yan Long, Jixiang Meng:
The Properties of Transformation Digraphs Dxyz. Ars Comb. 103: 353-358 (2012) - [j16]Juan Liu, Jixiang Meng, Xindong Zhang:
The Transformation Digraph D++-. Ars Comb. 104: 525-535 (2012) - [j15]Huiping Cai, Juan Liu, Jixiang Meng:
Domination number in iterated line digraph of a complete bipartite digraph. Ars Comb. 107: 515-520 (2012) - [j14]Xing Chen, Juan Liu, Jixiang Meng:
λ-Optimality of Bipartite Digraphs. Inf. Process. Lett. 112(17-18): 701-705 (2012) - 2011
- [j13]Juan Liu, Xindong Zhang, Jixiang Meng:
The Properties of Middle Digraphs. Ars Comb. 101: 153-160 (2011) - [j12]Xindong Zhang, Juan Liu, Jixiang Meng:
Domination in lexicographic product graphs. Ars Comb. 101: 251-256 (2011) - [j11]Xing Chen, Juan Liu, Jixiang Meng:
Total restrained domination in graphs. Comput. Math. Appl. 62(8): 2892-2898 (2011) - [j10]Juan Liu, Xindong Zhang, Jixiang Meng:
On domination number of Cartesian product of directed paths. J. Comb. Optim. 22(4): 651-662 (2011) - 2010
- [j9]Juan Liu, Jixiang Meng, Zhao Zhang:
Double-super-connected digraphs. Discret. Appl. Math. 158(9): 1012-1016 (2010) - [j8]Juan Liu, Xindong Zhang, Xing Chen, Jixiang Meng:
On domination number of Cartesian product of directed cycles. Inf. Process. Lett. 110(5): 171-173 (2010) - [j7]Xindong Zhang, Juan Liu, Xing Chen, Jixiang Meng:
Domination number of Cartesian products of directed cycles. Inf. Process. Lett. 111(1): 36-39 (2010)
2000 – 2009
- 2009
- [j6]Juan Liu, Lin Sun, Jixiang Meng:
A line digraph of a complete bipartite digraph. Appl. Math. Lett. 22(4): 544-547 (2009) - [j5]Juan Liu, Xing Chen, Jixiang Meng:
Super restricted edge connected Cartesian product graphs. Inf. Process. Lett. 109(13): 655-659 (2009) - [j4]Xindong Zhang, Juan Liu, Jixiang Meng:
The bondage number in complete t-partite digraphs. Inf. Process. Lett. 109(17): 997-1000 (2009) - [j3]Xing Chen, Juan Liu, Jixiang Meng:
The restricted arc connectivity of Cartesian product digraphs. Inf. Process. Lett. 109(21-22): 1202-1205 (2009) - 2008
- [j2]Juan Liu, Jixiang Meng:
Super-Arc-Connected and Super-Connected Total Digraphs. Ars Comb. 87 (2008) - [j1]Juan Liu, Jixiang Meng:
Super-connected and super-arc-connected Cartesian product of digraphs. Inf. Process. Lett. 108(3): 90-93 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
