Chengfu Ye

According to our database¹, Chengfu Ye authored at least 31 papers between 1997 and 2023.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2023

Dominated coloring in product graphs.

[BibT_eX]

[DOI]

Minhui Li

Shumin Zhang

Chengfu Ye

J. Comb. Optim., November, 2023

Non-Inclusive Diagnosability of Alternating Group Graphs.

[BibT_eX]

[DOI]

Parallel Process. Lett., September, 2023

Graphic lattices made by graph felicitous-type labelings and colorings of topological coding.

[BibT_eX]

[DOI]

Discret. Appl. Math., September, 2023

2022

Two kinds of conditional connectivity of hypercubes.

[BibT_eX]

[DOI]

AKCE Int. J. Graphs Comb., September, 2022

Reliability of the round matching composition networks based on g-extra conditional fault.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

2021

The g-component connectivity of graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Fractional Strong Matching Preclusion for DHcube.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2021

2020

Fractional Matching Preclusion for Folded Petersen Cube Networks.

[BibT_eX]

[DOI]

Jinyu Zou

Chengfu Ye

Haizhen Ren

J. Interconnect. Networks, 2020

2019

Fractional Matching Preclusion for Möbius Cubes.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2019

Fractional matching preclusion for radix triangular mesh.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2019

Gallai-Ramsey numbers for books.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

2018

On the Steiner 4-Diameter of Graphs.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2018

Matching Preclusion Number of Radix Triangular Mesh with Odd Vertices.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2018

2017

Super Edge-Connectivity of Strong Product Graphs.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2017

The chromatic equivalence class of graph ψn3(n-3, 1).

[BibT_eX]

Ars Comb., 2017

More on the Inverse Problem of Steiner Wiener Index.

[BibT_eX]

[DOI]

Proceedings of the 14th International Symposium on Pervasive Systems, 2017

2016

Rainbow vertex-connection and graph products.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2016

Monochromatic connectivity and graph products.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2016

The fifth coefficient of adjoint polynomial and a new invariant.

[BibT_eX]

Yaping Mao

Chengfu Ye

Ars Comb., 2016

2015

On the path-connectivity of lexicographic product graphs.

[BibT_eX]

Shumin Zhang

Chengfu Ye

Ars Comb., 2015

2013

Almost every complement of a tadpole graph is not chromatically unique.

[BibT_eX]

Ars Comb., 2013

2009

The cospectral equivalence classes of graphs having an isolated vertex.

[BibT_eX]

[DOI]

Comput. Math. Appl., 2009

A new expression for the adjoint polynomial of a path.

[BibT_eX]

[DOI]

Australas. J Comb., 2009

Minimal Merrifield-Simmons Index of 5-leaf-trees.

[BibT_eX]

[DOI]

Chengfu Ye

Proceedings of the 2009 International Conference on Computational Intelligence and Security, 2009

2008

The chromatic equivalence class of graph ‾{Bn-6, 12}.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2008

A complete solution to the chromatic equivalence class of graph I.

[BibT_eX]

[DOI]

Discret. Math., 2008

Trees with m-matchings and the fourth and fifth minimal Hosoya index.

[BibT_eX]

[DOI]

Chengfu Ye

Jianfeng Wang

Comput. Math. Appl., 2008

2004

The Chromaticity of Certain Complete Multipartite Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2004

A complete solution to a conjecture on chromatic uniqueness of complete tripartite graphs.

[BibT_eX]

[DOI]

Ruying Liu

Haixing Zhao

Chengfu Ye

Discret. Math., 2004

2002

Graphs with chromatic polynomial sum(...).

[BibT_eX]

[DOI]

Chengfu Ye

Nianzu Li

Discret. Math., 2002

1997

New families of adjointly unique graphs.

[BibT_eX]

[DOI]

Chengfu Ye

Xuewen Bao

Discret. Math., 1997

Chengfu Ye

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...