Kecai Deng

According to our database, Kecai Deng authored at least 10 papers between 2016 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2023

The maximum Mostar indices of unicyclic graphs with given diameter.

Guorong Liu, Kecai Deng

Appl. Math. Comput., 2023

2022

Antimagic labeling of some biregular bipartite graphs.

Kecai Deng, Yunfei Li

Discuss. Math. Graph Theory, 2022

2021

On the extremal values for the Mostar index of trees with given degree sequence.

Kecai Deng, Shuchao Li

Appl. Math. Comput., 2021

2019

Recent progress on strong edge-coloring of graphs.

Kecai Deng, Gexin Yu, Xiangqian Zhou

Discret. Math. Algorithms Appl., 2019

Caterpillars with maximum degree 3 are antimagic.

Kecai Deng, Yunfei Li

Discret. Math., 2019

Strong edge-coloring for planar graphs with large girth.

Lily Chen, Kecai Deng, Gexin Yu, Xiangqian Zhou

Discret. Math., 2019

2018

On Critical Circuits in <i>k</i>-Connected Matroids.

João Paulo Costalonga, Kecai Deng, Xiangqian Zhou

Graphs Comb., 2018

Distance two labelings in regular bipartite graphs.

Xiaoling Zhang, Kecai Deng

Ars Comb., 2018

2017

Characterization results for <i>L(2, 1, 1)</i>-labeling problem on trees.

Kecai Deng, Xiaoling Zhang

Discuss. Math. Graph Theory, 2017

2016

The L(2, 1, 1)-labellings of caterpillars.

Xiaoling Zhang, Kecai Deng

Int. J. Comput. Math. Comput. Syst. Theory, 2016