![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Jianxi Liu
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
- [j13]Yue Guan, Bo Cheng, Minfeng Chen
, Meili Liang, Jianxi Liu, Jinxun Wang, Chao Yang
, Li Zeng:
The Spectral Distribution of Random Mixed Graphs. Axioms 11(3): 126 (2022) - [j12]Meili Liang, Jianxi Liu:
Typical Structure of Oriented Graphs and Digraphs with Forbidden Blow-Up Transitive Triangles. Symmetry 14(12): 2551 (2022) - 2016
- [j11]Meili Liang, Jianxi Liu
:
Proofs of conjectures on the Randić index and average eccentricity. Discret. Appl. Math. 202: 188-193 (2016) - 2015
- [j10]Jianxi Liu:
Harmonic index of dense graphs. Ars Comb. 120: 293-304 (2015) - [j9]Dongsheng Guo, Yunong Zhang, Zhengli Xiao, Mingzhi Mao
, Jianxi Liu:
Common nature of learning between BP-type and Hopfield-type neural networks. Neurocomputing 167: 578-586 (2015) - 2014
- [j8]Jianxi Liu:
The Randic index and girth of triangle-free graphs. Ars Comb. 113: 289-297 (2014) - 2013
- [j7]Jianxi Liu:
On a conjecture of the Randić index and the minimum degree of graphs. Discret. Appl. Math. 161(16-17): 2544-2548 (2013) - [j6]Bolian Liu, Ljiljana Pavlovic
, Tomica Divnic, Jianxi Liu, Marina M. Stojanovic:
On the conjecture of Aouchiche and Hansen about the Randić index. Discret. Math. 313(3): 225-235 (2013) - 2011
- [j5]Jianxi Liu, Meili Liang, Bo Cheng, Bolian Liu:
A proof for a conjecture on the Randić index of graphs with diameter. Appl. Math. Lett. 24(5): 752-756 (2011) - 2010
- [j4]Xueliang Li, Jianxi Liu, Lingping Zhong:
Trees with a given order and matching number that have maximum general Randic index. Discret. Math. 310(17-18): 2249-2257 (2010) - [j3]Xueliang Li, Bolian Liu, Jianxi Liu:
Complete solution to a conjecture on Randic index. Eur. J. Oper. Res. 200(1): 9-13 (2010) - 2009
- [j2]Xueliang Li, Jianxi Liu:
A proof of a conjecture on the Randic index of graphs with given girth. Discret. Appl. Math. 157(15): 3332-3335 (2009) - [j1]Xueliang Li, Jianxi Liu:
Complete solution to a conjecture on the Randic index of triangle-free graphs. Discret. Math. 309(21): 6322-6324 (2009)
Conference and Workshop Papers
- 2015
- [c2]Yunong Zhang, Jianxi Liu, Xiaogang Yan, Binbin Qiu, Tianjian Qiao:
WASD neuronet prediction for China's population. ICIA 2015: 797-802 - 2014
- [c1]Yunong Zhang, Jianxi Liu, Dongsheng Guo, Sitong Ding, Hongzhou Tan
:
Power-Activated WASD Neuronet Based Russian Population Estimation, Correction, and Prediction. CSE 2014: 1232-1236
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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 2024-04-24 22:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint