default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChengfu Ye
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j34]Bo Zhu, Shumin Zhang, Chengfu Ye:
A novel conditional connectivity to measure network reliability: r -component block connectivity. Int. J. Comput. Math. Comput. Syst. Theory 9(1): 33-40 (2024)- [j33]Shumin Zhang, Ting Tian, Yalan Li, Chengfu Ye:
Non-inclusive g -good-neighbour diagnosability of hypercubes. Int. J. Comput. Math. Comput. Syst. Theory 9(1): 54-63 (2024) - [j32]Huifen Ge, Shumin Zhang, Chengfu Ye:
The Structure Fault Tolerance of Alternating Group Networks. Int. J. Found. Comput. Sci. 35(4): 483-500 (2024) - [j31]Yulin Han, Yalan Li, Chengfu Ye:
The cyclic diagnosability of balanced hypercubes under the PMC and MM⁎ model. Theor. Comput. Sci. 1018: 114816 (2024) - [j30]Bo Zhu, Shumin Zhang, Jinyu Zou, Chengfu Ye:
The g-faulty-block connectivity of folded hypercubes. J. Supercomput. 80(9): 12512-12526 (2024) - 2023
- [j29]Xiaohui Zhang, Shumin Zhang, Chengfu Ye, Bing Yao:
Graphic lattices made by graph felicitous-type labelings and colorings of topological coding. Discret. Appl. Math. 336: 37-46 (2023) - [j28]Minhui Li
, Shumin Zhang, Chengfu Ye:
Dominated coloring in product graphs. J. Comb. Optim. 46(4): 24 (2023) - [j27]Nengjin Zhuo, Shumin Zhang, Chengfu Ye, Yalan Li:
Non-Inclusive Diagnosability of Alternating Group Graphs. Parallel Process. Lett. 33(3): 2350007:1-2350007:16 (2023) - 2022
- [j26]Bo Zhu, Shumin Zhang, Jinyu Zou, Chengfu Ye:
Two kinds of conditional connectivity of hypercubes. AKCE Int. J. Graphs Comb. 19(3): 255-260 (2022) - [j25]Yalan Li, Jichang Wu, Shumin Zhang, Chengfu Ye:
Reliability of the round matching composition networks based on g-extra conditional fault. Theor. Comput. Sci. 905: 1-9 (2022) - 2021
- [j24]He Zhang, Jinyu Zou, Shuangshuang Zhang, Chengfu Ye:
Fractional Strong Matching Preclusion for DHcube. Parallel Process. Lett. 31(1): 2150001:1-2150001:13 (2021) - [j23]He Li, Shumin Zhang, Chengfu Ye, Shuming Zhou:
The g-component connectivity of graphs. Theor. Comput. Sci. 889: 96-104 (2021) - 2020
- [j22]Jinyu Zou, Chengfu Ye, Haizhen Ren:
Fractional Matching Preclusion for Folded Petersen Cube Networks. J. Interconnect. Networks 20(4): 2150003:1-2150003:16 (2020) - 2019
- [j21]Jinyu Zou, Yaping Mao, Colton Magnant, Zhao Wang, Chengfu Ye:
Gallai-Ramsey numbers for books. Discret. Appl. Math. 268: 164-177 (2019) - [j20]Xia Wang, Tianlong Ma, Jun Yin, Chengfu Ye:
Fractional matching preclusion for radix triangular mesh. Discret. Math. Algorithms Appl. 11(4): 1950048:1-1950048:12 (2019) - [j19]Yalan Li, Chengfu Ye, Miaolin Wu, Ping Han:
Fractional Matching Preclusion for Möbius Cubes. J. Interconnect. Networks 19(4): 1950007:1-1950007:15 (2019) - 2018
- [j18]Zhao Wang, Yaping Mao, Hengzhe Li, Chengfu Ye:
On the Steiner 4-Diameter of Graphs. J. Interconnect. Networks 18(1): 1850002:1-1850002:15 (2018) - [j17]Chunxia Wang, Yalan Li, Shumin Zhang, Chengfu Ye, Xia Wang:
Matching Preclusion Number of Radix Triangular Mesh with Odd Vertices. J. Interconnect. Networks 18(2-3): 1850010:1-1850010:13 (2018) - 2017
- [j16]Yaping Mao, Chengfu Ye, Hengzhe Li, Shumin Zhang:
The chromatic equivalence class of graph ψn3(n-3, 1). Ars Comb. 135: 399-421 (2017) - [j15]Zhao Wang, Yaping Mao, Chengfu Ye, Haixing Zhao:
Super Edge-Connectivity of Strong Product Graphs. J. Interconnect. Networks 17(2): 1750007:1-1750007:14 (2017) - 2016
- [j14]Yaping Mao, Chengfu Ye:
The fifth coefficient of adjoint polynomial and a new invariant. Ars Comb. 128: 83-102 (2016) - [j13]Yaping Mao, Zhao Wang, Fengnan Yanling, Chengfu Ye:
Monochromatic connectivity and graph products. Discret. Math. Algorithms Appl. 8(1): 1650011:1-1650011:18 (2016) - [j12]Yaping Mao, Fengnan Yanling, Zhao Wang, Chengfu Ye:
Rainbow vertex-connection and graph products. Int. J. Comput. Math. 93(7): 1078-1092 (2016) - 2015
- [j11]Shumin Zhang, Chengfu Ye:
On the path-connectivity of lexicographic product graphs. Ars Comb. 121: 141-158 (2015) - 2013
- [j10]Jianfeng Wang, Qiongxiang Huang, Kok Lay Teo, Francesco Belardo, Ruying Liu, Chengfu Ye:
Almost every complement of a tadpole graph is not chromatically unique. Ars Comb. 108: 33-49 (2013) - 2009
- [j9]Jianfeng Wang, Kee L. Teo, Qiongxiang Huang, Chengfu Ye, Ruying Liu:
A new expression for the adjoint polynomial of a path. Australas. J Comb. 43: 103-114 (2009) - [j8]Jianfeng Wang, Qiongxiang Huang, Yongzhi Liu, Ruying Liu, Chengfu Ye:
The cospectral equivalence classes of graphs having an isolated vertex. Comput. Math. Appl. 57(10): 1638-1644 (2009) - 2008
- [j7]Chengfu Ye, Jianfeng Wang:
Trees with m-matchings and the fourth and fifth minimal Hosoya index. Comput. Math. Appl. 56(2): 387-399 (2008) - [j6]Jianfeng Wang, Ruying Liu, Chengfu Ye, Qiongxiang Huang:
A complete solution to the chromatic equivalence class of graph I. Discret. Math. 308(16): 3607-3623 (2008) - [j5]Qiongxiang Huang, Ruying Liu, Jianfeng Wang, Chengfu Ye:
The chromatic equivalence class of graph ‾{Bn-6, 12}. Discuss. Math. Graph Theory 28(2): 189-218 (2008) - 2004
- [j4]Ruying Liu, Haixing Zhao, Chengfu Ye:
A complete solution to a conjecture on chromatic uniqueness of complete tripartite graphs. Discret. Math. 289(1-3): 175-179 (2004) - [j3]Haixing Zhao, Xueliang Li, Ruying Liu, Chengfu Ye:
The Chromaticity of Certain Complete Multipartite Graphs. Graphs Comb. 20(3): 423-434 (2004) - 2002
- [j2]Chengfu Ye, Nianzu Li:
Graphs with chromatic polynomial sum(...). Discret. Math. 259(1-3): 369-381 (2002) - 1997
- [j1]Chengfu Ye, Xuewen Bao:
New families of adjointly unique graphs. Discret. Math. 172(1-3): 155-162 (1997)
Conference and Workshop Papers
- 2017
- [c2]He Li, Chengfu Ye, Jun Yin, Piaojuan Hu:
More on the Inverse Problem of Steiner Wiener Index. ISPAN-FCST-ISCC 2017: 520-523 - 2009
- [c1]Chengfu Ye:
Minimal Merrifield-Simmons Index of 5-leaf-trees. CIS (1) 2009: 264-267
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-09-13 01:41 CEST 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:
