Enumeration of 2-regular circulant graphs and directed double networks. - Aygul Mamut; Qiongxiang Huang; Fenjin Liu (Discret. Appl. Math., 2009)

On the spectral radii of weighted double stars. - Fenjin Liu; Qiongxiang Huang; Xingming Tao (Appl. Math. Lett., 2012)

On the spectral radius of quasi-unicycle graphs. - Fenjin Liu; Qiongxiang Huang (Ars Comb., 2013)

The Spectral Radius of Maximum Weighted Unicyclic Graph. - Xingming Tao; Qiongxiang Huang; Fenjin Liu (Ars Comb., 2014)

On Schwenk-like formulas for Q-characteristic polynomials of graphs. - Fenjin Liu (Ars Comb., 2015)

A Note on Non-ℝ-Cospectral Graphs. - Fenjin Liu; Wei Wang 195 (Electron. J. Comb., 2017)

New families of graphs determined by their generalized spectrum. - Fenjin Liu; Johannes Siemons; Wei Wang 195 (Discret. Math., 2019)

Graphs with n-1 main eigenvalues. - Zenan Du; Fenjin Liu; Shunyi Liu; Zhongmei Qin (Discret. Math., 2021)

Generalized spectral characterizations of almost controllable graphs. - Wei Wang 052; Fenjin Liu; Wei Wang 195 (Eur. J. Comb., 2021)

Infinite families of $ t $-designs and strongly regular graphs from punctured codes. - Ziling Heng; Dexiang Li; Fenjin Liu; Weiqiong Wang (Adv. Math. Commun., 2022)

Constructing cospectral graphs via regular rational orthogonal matrices with level two. - Lihuan Mao; Wei Wang 195; Fenjin Liu; Lihong Qiu (Discret. Math., 2023)

Ternary self-orthogonal codes from weakly regular bent functions and their application in LCD Codes. - Ziling Heng; Dexiang Li; Fenjin Liu (Des. Codes Cryptogr., 2023)

Non-cospectral equienergetic trees of diameter at most four. - Fenjin Liu; Ke Su; Wei Wang; Hao Zhang (Appl. Math. Comput., 2025)

Which graphs are determined by their total number of walks? - Weifang Lv; Fenjin Liu; Wei Wang; Wei Wang (Discret. Appl. Math., 2026)