default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHong Bian
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j18]Chengmin Li, Hong Bian
, Haizheng Yu, Yuefen Cao:
Resistance distance and Kirchhoff index based on degree for a cyclic triangular bipyramid hexahedron. Comput. Appl. Math. 44(1): 18 (2025)- [j17]Chengmin Li, Hong Bian, Haizheng Yu:
Extremal polyphenyl chains with respect to the Kirchhoff index. Theor. Comput. Sci. 1023: 114893 (2025) - 2024
- [c2]Haizheng Yu, Hong Bian:
Interpretable Coronary Artery Disease Prediction Based on K-Stacking Model. ICIC (LNAI 1) 2024: 451-463 - 2023
- [j16]Minghong Yao, Haizheng Yu, Hong Bian:
Defending against adversarial attacks on graph neural networks via similarity property. AI Commun. 36(1): 27-39 (2023) - [c1]Minghong Yao, Haizheng Yu, Hong Bian:
Graph Multi-dimensional Feature Network. ICONIP (7) 2023: 149-160 - 2022
- [j15]Xue Yang, Hong Bian, Haizheng Yu, Dandan Liu:
The Local Antimagic Total Chromatic Number of Some Wheel-Related Graphs. Axioms 11(3): 97 (2022)
2010 – 2019
- 2019
- [j14]Xiaoling Ma, Hong Bian:
The normalized Laplacians, degree-Kirchhoff index and the spanning trees of hexagonal Möbius graphs. Appl. Math. Comput. 355: 33-46 (2019) - 2017
- [j13]Li Ma, Hong Bian, Bingjie Liu, Haizheng Yu:
The Expected Values of the Wiener Indices in the Random phenylene and spiro chains. Ars Comb. 130: 267-274 (2017) - 2016
- [j12]Xuehong Yin, Hong Bian, Haizheng Yu:
The Co-PI index of some compound graphs. Ars Comb. 128: 331-339 (2016) - 2014
- [j11]Xiaoling Ma, Hong Bian, Haizheng Yu:
Extremal Polyphenyl Spiders Concerning k-matchings and k-independent Sets. Ars Comb. 113: 3-11 (2014) - 2013
- [j10]Xiaoling Ma, Hong Bian, Haizheng Yu:
Schultz and Zagreb indices in corona of two graphs. Ars Comb. 112: 55-64 (2013) - 2012
- [j9]Hong Bian, Xiaoling Ma, Elkin Vumar, Haizheng Yu:
The Wiener-type indices of the corona of two graphs. Ars Comb. 107: 193-199 (2012) - 2011
- [j8]Shuhua Li, Hong Bian, Guoping Wang, Haizheng Yu:
Vertex PI indices of some sums of graphs. Ars Comb. 98: 63-71 (2011) - [j7]Hong Bian, Fuji Zhang, Guoping Wang, Haizheng Yu:
Extremal polygonal cactus chain concerning k-independent sets. Ars Comb. 98: 167-172 (2011) - [j6]Hong Bian, Fuji Zhang, Guoping Wang, Haizheng Yu:
Matching polynomials for chains of cycles. Discret. Math. 311(4): 319-323 (2011) - [j5]Haizheng Yu, Jianfeng Ma, Hong Bian:
Reasonable routing in delay/disruption tolerant networks. Frontiers Comput. Sci. China 5(3): 327-334 (2011) - [j4]Haizheng Yu, Hong Bian:
Threshold-based Message Copies Control in Delay Tolerant Networks. J. Networks 6(1): 96-103 (2011) - 2010
- [j3]Shuhua Li, Hong Bian, Fuji Zhang, Guoping Wang:
Extremal polyphenyl chains concerning k-matchings and k-independent sets. Ars Comb. 96 (2010)
2000 – 2009
- 2009
- [j2]Guoping Wang, Fei Zhu, Hong Bian:
Note on the nullity of bicyclic graphs. Ars Comb. 91 (2009) - [j1]Hong Bian, Fuji Zhang:
The graph of perfect matching polytope and an extreme problem. Discret. Math. 309(16): 5017-5023 (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-12-02 21:33 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:
