New families of adjointly unique graphs. - Chengfu Ye; Xuewen Bao (Discret. Math., 1997)

Graphs with chromatic polynomial sum(...). - Chengfu Ye; Nianzu Li (Discret. Math., 2002)

A complete solution to a conjecture on chromatic uniqueness of complete tripartite graphs. - Ruying Liu; Haixing Zhao; Chengfu Ye (Discret. Math., 2004)

The Chromaticity of Certain Complete Multipartite Graphs. - Haixing Zhao; Xueliang Li 001; Ruying Liu; Chengfu Ye (Graphs Comb., 2004)

Trees with m-matchings and the fourth and fifth minimal Hosoya index. - Chengfu Ye; Jianfeng Wang (Comput. Math. Appl., 2008)

A complete solution to the chromatic equivalence class of graph I. - Jianfeng Wang; Ruying Liu; Chengfu Ye; Qiongxiang Huang (Discret. Math., 2008)

The chromatic equivalence class of graph ‾{Bn-6, 12}. - Qiongxiang Huang; Ruying Liu; Jianfeng Wang; Chengfu Ye (Discuss. Math. Graph Theory, 2008)

Minimal Merrifield-Simmons Index of 5-leaf-trees. - Chengfu Ye (CIS (1), 2009)

A new expression for the adjoint polynomial of a path. - Jianfeng Wang; Kee L. Teo; Qiongxiang Huang; Chengfu Ye; Ruying Liu (Australas. J Comb., 2009)

The cospectral equivalence classes of graphs having an isolated vertex. - Jianfeng Wang; Qiongxiang Huang; Yongzhi Liu; Ruying Liu; Chengfu Ye (Comput. Math. Appl., 2009)

Almost every complement of a tadpole graph is not chromatically unique. - Jianfeng Wang; Qiongxiang Huang; Kok Lay Teo; Francesco Belardo; Ruying Liu; Chengfu Ye (Ars Comb., 2013)

On the path-connectivity of lexicographic product graphs. - Shumin Zhang; Chengfu Ye (Ars Comb., 2015)

The fifth coefficient of adjoint polynomial and a new invariant. - Yaping Mao; Chengfu Ye (Ars Comb., 2016)

Monochromatic connectivity and graph products. - Yaping Mao; Zhao Wang 007; Fengnan Yanling; Chengfu Ye (Discret. Math. Algorithms Appl., 2016)

Rainbow vertex-connection and graph products. - Yaping Mao; Fengnan Yanling; Zhao Wang 007; Chengfu Ye (Int. J. Comput. Math., 2016)

More on the Inverse Problem of Steiner Wiener Index. - He Li; Chengfu Ye; Jun Yin; Piaojuan Hu (ISPAN-FCST-ISCC, 2017)

The chromatic equivalence class of graph ψn3(n-3, 1). - Yaping Mao; Chengfu Ye; Hengzhe Li; Shumin Zhang (Ars Comb., 2017)

Super Edge-Connectivity of Strong Product Graphs. - Zhao Wang 007; Yaping Mao; Chengfu Ye; Haixing Zhao (J. Interconnect. Networks, 2017)

Matching Preclusion Number of Radix Triangular Mesh with Odd Vertices. - Chunxia Wang; Yalan Li; Shumin Zhang; Chengfu Ye; Xia Wang (J. Interconnect. Networks, 2018)

On the Steiner 4-Diameter of Graphs. - Zhao Wang 007; Yaping Mao; Hengzhe Li; Chengfu Ye (J. Interconnect. Networks, 2018)

Gallai-Ramsey numbers for books. - Jinyu Zou; Yaping Mao; Colton Magnant; Zhao Wang 007; Chengfu Ye (Discret. Appl. Math., 2019)

Fractional matching preclusion for radix triangular mesh. - Xia Wang; Tianlong Ma; Jun Yin; Chengfu Ye (Discret. Math. Algorithms Appl., 2019)

Fractional Matching Preclusion for Möbius Cubes. - Yalan Li; Chengfu Ye; Miaolin Wu; Ping Han (J. Interconnect. Networks, 2019)

Fractional Matching Preclusion for Folded Petersen Cube Networks. - Jinyu Zou; Chengfu Ye; Haizhen Ren (J. Interconnect. Networks, 2020)

Fractional Strong Matching Preclusion for DHcube. - He Zhang; Jinyu Zou; Shuangshuang Zhang; Chengfu Ye (Parallel Process. Lett., 2021)

The g-component connectivity of graphs. - He Li; Shumin Zhang; Chengfu Ye; Shuming Zhou (Theor. Comput. Sci., 2021)

Reliability of the round matching composition networks based on g-extra conditional fault. - Yalan Li; Jichang Wu; Shumin Zhang; Chengfu Ye (Theor. Comput. Sci., 2022)

Two kinds of conditional connectivity of hypercubes. - Bo Zhu; Shumin Zhang; Jinyu Zou; Chengfu Ye (AKCE Int. J. Graphs Comb., 2022)

Graphic lattices made by graph felicitous-type labelings and colorings of topological coding. - Xiaohui Zhang 009; Shumin Zhang; Chengfu Ye; Bing Yao (Discret. Appl. Math., 2023)

Non-Inclusive Diagnosability of Alternating Group Graphs. - Nengjin Zhuo; Shumin Zhang; Chengfu Ye; Yalan Li (Parallel Process. Lett., 2023)

Dominated coloring in product graphs. - Minhui Li; Shumin Zhang; Chengfu Ye (J. Comb. Optim., 2023)

Non-inclusive g -good-neighbour diagnosability of hypercubes. - Shumin Zhang; Ting Tian; Yalan Li; Chengfu Ye (Int. J. Comput. Math. Comput. Syst. Theory, 2024)

A novel conditional connectivity to measure network reliability: r -component block connectivity. - Bo Zhu; Shumin Zhang; Chengfu Ye (Int. J. Comput. Math. Comput. Syst. Theory, 2024)

The cyclic diagnosability of balanced hypercubes under the PMC and MM⁎ model. - Yulin Han; Yalan Li; Chengfu Ye (Theor. Comput. Sci., 2024)

The Structure Fault Tolerance of Alternating Group Networks. - Huifen Ge; Shumin Zhang; Chengfu Ye (Int. J. Found. Comput. Sci., 2024)

The g-faulty-block connectivity of folded hypercubes. - Bo Zhu; Shumin Zhang; Jinyu Zou; Chengfu Ye (J. Supercomput., 2024)

Graphic lattice constructed by graceful-difference total colorings. - Xiaohui Zhang 009; Shumin Zhang; Chengfu Ye; Bing Yao (Discret. Math. Algorithms Appl., 2024)

Partial Domination of Hypergraphs. - Minhui Li; Shumin Zhang; Chengfu Ye (Graphs Comb., 2024)

Non-inclusive diagnosability of folded hypercube-like networks. - Nengjin Zhuo; Shumin Zhang; Jou-Ming Chang; Chengfu Ye (Discret. Appl. Math., 2025)

The h-Component Diagnosability of Alternating Group Graphs. - Nengjin Zhuo; Shumin Zhang; Yalan Li; Chengfu Ye (Int. J. Found. Comput. Sci., 2025)

Non-inclusive g-extra diagnosability of regular networks under the MM* model. - Nengjin Zhuo; Shumin Zhang; Jou-Ming Chang; Chengfu Ye (J. Appl. Math. Comput., 2025)