default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhibin Du
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j37]Zhibin Du, Zi-Ming Zhou, Hai-Ying Shan, Chang-Xiang He:
Corrigendum to "On the sum of the first two largest signless Laplacian eigenvalues of a graph" [Discrete Math. 347 (2024) 114035]. Discret. Math. 348(2): 114241 (2025)- 2024
- [j36]Zhibin Du
, Yinhao Huang:
Some extensions of Collatz (periodic) conjecture. Appl. Math. Comput. 475: 128742 (2024) - [j35]Abeer M. Albalahi, Zhibin Du, Akbar Ali, Abdulaziz Mohammed Alanazi:
On the graphs of a fixed cyclomatic number and order with minimum general sum-connectivity and Platt indices. Comput. Appl. Math. 43(3): 137 (2024) - [j34]Joshua Cooper, Zhibin Du:
Note on the Spectra of Steiner Distance Hypermatrices. Electron. J. Comb. 31(3) (2024) - 2023
- [j33]Rundan Xing, Zhibin Du:
A q-analogue of distance matrix of block graphs. Adv. Appl. Math. 149: 102548 (2023) - [j32]Rundan Xing, Zhibin Du:
The exponential distance matrix of block graphs. Appl. Math. Comput. 447: 127673 (2023) - [j31]Jiatao Chen, Biqing Zeng, Zhibin Du, Huimin Deng, Mayi Xu, Zibang Gan, Meirong Ding:
RFM: response-aware feedback mechanism for background based conversation. Appl. Intell. 53(9): 10858-10878 (2023) - [j30]Darko Dimitrov, Zhibin Du:
Complete characterization of the minimal-ABC trees. Discret. Appl. Math. 336: 148-194 (2023) - [j29]Zhibin Du, Ting-Wei Chao, Yeong-Nan Yeh:
Several improved asymptotic normality criteria and their applications to graph polynomials. Discret. Math. 346(5): 113303 (2023) - [j28]Zhibin Du, Carlos M. da Fonseca:
The number of P-vertices for acyclic matrices with given nullity. Discret. Math. 346(12): 113592 (2023) - 2022
- [j27]Zhibin Du, Darko Dimitrov, Carlos M. da Fonseca:
New strong divisibility sequences. Ars Math. Contemp. 22(1): 1 (2022) - [j26]Zhibin Du, Yingqiu Xu:
A generalization of Alon-Aydinian-Huang theorem. Discret. Math. 345(9): 112968 (2022) - [c9]Qidong Zhao, Zheng Tong, Yunshuang Zhang, Chen Chao, Qingyu Zhang, Shuai Zhao, Zhibin Du:
The Research on the Identification of ACC SOTIF Triggering Conditions Based on Scenario Analysis. RCAR 2022: 263-266 - [c8]Junfeng Li, Yunshuang Zhang, Shuai Zhao, Chen Chao, Zhibin Du:
A Research on SOTIF of LKA based on STPA. RCAR 2022: 396-400 - [c7]Zhibin Du, Hui Xie, WenYuan Wei:
System Architecture and Key Technologies of Internet of Vehicles Pilot Area*. RCAR 2022: 462-468 - 2021
- [j25]Darko Dimitrov, Zhibin Du:
A solution of the conjecture about big vertices of minimal-ABC trees. Appl. Math. Comput. 397: 125818 (2021) - [j24]Yan Yuan, Bo Zhou, Zhibin Du:
On large ABC spectral radii of unicyclic graphs. Discret. Appl. Math. 298: 56-65 (2021) - 2020
- [j23]Zhibin Du, Darko Dimitrov:
The minimal-ABC trees with $$B_2$$-branches. Comput. Appl. Math. 39(2) (2020) - [j22]Zhibin Du, Jean Yeh:
Another simple proof of Graham and Pollak's theorem. Discret. Math. 343(10): 111994 (2020) - [j21]Carlos M. da Fonseca, Zhibin Du:
The number of P-vertices of singular acyclic matrices: An inverse problem. Discuss. Math. Graph Theory 40(2): 525-532 (2020) - [j20]Wan Nor Nabila Nadia Wan Zuki, Zhibin Du, Muhammad Kamran Jamil, Roslan Hasni:
Extremal Trees with Respect to the Difference between Atom-Bond Connectivity Index and Randić Index. Symmetry 12(10): 1591 (2020) - [j19]Yan-An Yao, Zhibin Du, Xiaoyan Huang, Ran Li:
Derivation and simulation verification of the relationship between world coordinates and local coordinates under virtual reality engine. Virtual Real. 24(2): 263-269 (2020) - [c6]Zhang Lu, Zhibin Du, Xianglei Zhu:
Research on Automatic Generation Method of Scenario Based on Panosim. ICCDA 2020: 159-163
2010 – 2019
- 2019
- [j18]Akbar Ali, Shahzad Ahmed, Zhibin Du, Wei Gao, Muhammad Aslam Malik:
On the Minimal General Sum-Connectivity Index of Connected Graphs Without Pendant Vertices. IEEE Access 7: 136743-136751 (2019) - [j17]Akbar Ali, Darko Dimitrov, Zhibin Du, Faiza Ishfaq:
On the extremal graphs for general sum-connectivity index (χα) with given cyclomatic number when α>1. Discret. Appl. Math. 257: 19-30 (2019) - [j16]Zhibin Du, Carlos M. da Fonseca:
The number of P-vertices for acyclic matrices of maximum nullity. Discret. Appl. Math. 269: 211-219 (2019) - [j15]Zhibin Du, Carlos M. da Fonseca:
On the continuity of the maximum size of P-sets of acyclic matrices. Discret. Math. 342(8): 2278-2282 (2019) - [c5]Yao Tan, Liu Yang, Qinghua Hu, Zhibin Du:
Batch Mode Active Learning for Semantic Segmentation Based on Multi-Clue Sample Selection. CIKM 2019: 831-840 - [c4]Xiangyang Ye, Liu Yang, Qinghua Hu, Chenyang Shen, Liping Jing, Zhibin Du:
Heterogeneous Transfer Clustering for Partial Co-occurrence Data. ICTAI 2019: 1042-1049 - [c3]Yao Tan, Qinghua Hu, Zhibin Du:
Batch Mode Active Learning with Nonlocal Self-Similarity Prior for Semantic Segmentation. IJCNN 2019: 1-7 - [c2]Zhibin Du, Yao Tan, Liu Yang:
Cost-Effective Active Learning with Informativeness and Representativeness for Semantic Segmentation. ISCID (1) 2019: 37-40 - [c1]Maoying Li, Liu Yang, Qinghua Hu, Chenyang Shen, Zhibin Du:
Transfer Learning for Driving Pattern Recognition. PRICAI (2) 2019: 52-65 - 2018
- [j14]Zhibin Du, Darko Dimitrov:
The Minimal-ABC Trees With B-Branches II. IEEE Access 6: 66350-66366 (2018) - [j13]Zhibin Du:
A Diagonalization Algorithm for the Distance Matrix of Cographs. IEEE Access 6: 74931-74939 (2018) - [j12]Akbar Ali, Zhibin Du, Muhammad Ali:
A note on chemical trees with minimum Wiener polarity index. Appl. Math. Comput. 335: 231-236 (2018) - [j11]Darko Dimitrov, Zhibin Du, Carlos M. da Fonseca:
Some forbidden combinations of branches in minimal-ABC trees. Discret. Appl. Math. 236: 165-182 (2018) - 2017
- [j10]Zhibin Du:
Further results regarding the sum of domination number and average eccentricity. Appl. Math. Comput. 294: 299-309 (2017) - [i1]Darko Dimitrov, Zhibin Du, Carlos M. da Fonseca:
Forbidden branches in trees with minimal atom-bond connectivity index. CoRR abs/1706.08680 (2017) - 2016
- [j9]Darko Dimitrov, Zhibin Du, Carlos M. da Fonseca:
On structural properties of trees with minimal atom-bond connectivity index III: Trees with pendent paths of length three. Appl. Math. Comput. 282: 276-290 (2016) - [j8]Xuli Qi, Bo Zhou, Zhibin Du:
The Kirchhoff indices and the matching numbers of unicyclic graphs. Appl. Math. Comput. 289: 464-480 (2016) - [j7]Zhibin Du:
The least eigenvalues of unicyclic graphs. Ars Comb. 125: 109-119 (2016) - [j6]Zhibin Du, Aleksandar Ilic:
A proof of the conjecture regarding the sum of domination number and average eccentricity. Discret. Appl. Math. 201: 105-113 (2016) - [j5]Zhibin Du, Carlos M. da Fonseca:
On a family of trees with minimal atom-bond connectivity index. Discret. Appl. Math. 202: 37-49 (2016) - 2013
- [j4]Zhibin Du:
An edge grafting theorem on the Estrada index of graphs and its applications. Discret. Appl. Math. 161(1-2): 134-139 (2013) - 2011
- [j3]Zhibin Du, Bo Zhou, Nenad Trinajstic:
On the general sum-connectivity index of trees. Appl. Math. Lett. 24(3): 402-405 (2011) - 2010
- [j2]Rundan Xing, Bo Zhou, Zhibin Du:
Further results on atom-bond connectivity index of trees. Discret. Appl. Math. 158(14): 1536-1545 (2010)
2000 – 2009
- 2009
- [j1]Zhibin Du, Bo Zhou:
A Note on Wiener Indices of Unicyclic Graphs. Ars Comb. 93 (2009)
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 2024-11-14 00:51 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:
