On the largest eigenvalues of trees. - Xiang'en Chen (Discret. Math., 2004)

On Graceful Generalized Spiders and Caterpillars. - Hui Cheng; Bing Yao; Xiangen Chen; Zhongfu Zhang (Ars Comb., 2008)

Vertex-distinguishing total coloring of graphs. - Zhongfu Zhang; Pengxiang Qiu; Baogen Xu; Jingwen Li 001; Xiangen Chen; Bing Yao (Ars Comb., 2008)

On the adjacent vertex distinguishing total coloring numbers of graphs with Delta=3. - Xiang'en Chen (Discret. Math., 2008)

A Note on Chromatic Uniqueness of Certain Complete Tripartite Graphs. - Xiang'en Chen; Keyi Su; Bing Yao (Ars Comb., 2012)

A proof to the odd-gracefulness of all lobsters. - Xiangqian Zhou; Bing Yao; Xiangen Chen; Haixia Tao (Ars Comb., 2012)

Applying Graph theory to the Internet of Things. - Bing Yao; Xia Liu; Wan-Jia Zhang; Xiangen Chen; Xiao-Min Zhang; Ming Yao; Zheng-Xue Zhao (HPCC/EUC, 2013)

Vertex-distinguishing IE-total colorings of complete bipartite graphs Km, n(m<n). - Xiang'en Chen; Yuping Gao; Bing Yao (Discuss. Math. Graph Theory, 2013)

Not necessarily proper total colourings which are adjacent vertex distinguishing. - Xiang'en Chen; Yuping Gao; Bing Yao (Int. J. Comput. Math., 2013)

Every lobster is odd-elegant. - Xiangqian Zhou; Bing Yao; Xiangen Chen (Inf. Process. Lett., 2013)

On the vertex-distinguishing proper edge coloring of composition of complete graph and star. - Fang Yang; Xiang'en Chen; Chunyan Ma (Inf. Process. Lett., 2014)

Relations of vertex distinguishing total chromatic numbers between a subgraph and its supergraph. - Xiang'en Chen; Yuping Gao; Bing Yao (Inf. Sci., 2014)

On composition and decomposition of networks. - Xiaomin Wang; Bing Yao; Fei Ma 007; Xiyang Zhao; Jing Su 007; Xiangen Chen; Ming Yao (BMEI, 2015)

Hierarchical structure and particular spanning trees of edge-bound growing network models. - Xiaomin Wang; Bing Yao; Fei Ma 007; Jing Su 007; Xiangen Chen; Ming Yao (FSKD, 2015)

Total vertex irregularity strength of certain equitable complete m-partite graphs. - Jing Guo; Xiangen Chen; Zhiwen Wang; Bing Yao (Ars Comb., 2015)

Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with Δ = 9, 10, or 11. - Xiang'en Chen; Zepeng Li (Inf. Process. Lett., 2015)

Probing Graph Proper Total Colorings With Additional Constrained Conditions. - Bing Yao; Ming Yao; Xiangen Chen (CoRR, 2016)

On the vertex-distinguishing proper total colorings of complete p-partite graphs with equipotent parts. - Fang Yang; Xiangen Chen; Chunyan Ma (Ars Comb., 2017)