The Extremal Matching Energy of Graphs. - Shengjin Ji; Hongping Ma (Ars Comb., 2014)

The reformulated Zagreb indices of tricyclic graphs. - Shengjin Ji; Yongke Qu; Xia Li (Appl. Math. Comput., 2015)

On the tree with diameter 4 and maximal energy. - Suonan Renqian; Yunpeng Ge; Bofeng Huo; Shengjin Ji; Qiangqiang Diao (Appl. Math. Comput., 2015)

On the minimal energy of conjugated unicyclic graphs with maximum degree at most 3. - Hongping Ma; Yongqiang Bai; Shengjin Ji (Discret. Appl. Math., 2015)

The maximum matching energy of bicyclic graphs with even girth. - Gang Ma 005; Shengjin Ji; Qiuju Bian; Xia Li (Discret. Appl. Math., 2016)

The minimum matching energy of tricyclic graphs and given girth and without K4-subdivision. - Gang Ma 005; Shengjin Ji; Qiuju Bian; Xia Li (Ars Comb., 2017)

A lower bound of revised Szeged index of bicyclic graphs. - Shengjin Ji; Mengmeng Liu; Jianliang Wu 001 (Appl. Math. Comput., 2018)

On the first reformulated Zagreb indices of graphs with a given clique number. - Shengjin Ji; Qiuju Bian; Jianfeng Wang; Jianliang Wu 001 (Ars Comb., 2018)

On the sharp bounds of bicyclic graphs regarding edge Szeged index. - Yan Yao; Shengjin Ji; Guang Li (Appl. Math. Comput., 2020)

On the Zero Forcing Number and Spectral Radius of Graphs. - Wenqian Zhang; Jianfeng Wang; Weifan Wang 001; Shengjin Ji (Electron. J. Comb., 2022)

Note on Forcing Problem of Trees. - Mengya He; Shengjin Ji (Graphs Comb., 2022)

Correction to: Note on Forcing Problem of Trees. - Mengya He; Shengjin Ji (Graphs Comb., 2022)

Extremal Structure on Revised Edge-Szeged Index with Respect to Tricyclic Graphs. - Tongkun Qu; Shengjin Ji (Symmetry, 2022)

On minimum revised edge Szeged index of bicyclic graphs. - Mengmeng Liu; Shengjin Ji (AKCE Int. J. Graphs Comb., 2022)

The Zero Forcing Number of Graphs with the Matching Number and the Cyclomatic Number. - Yu Jing; Wenqian Zhang; Shengjin Ji (Graphs Comb., 2023)

Bounding the total forcing number of graphs. - Shengjin Ji; Mengya He; Guang Li; Yingui Pan; Wenqian Zhang (J. Comb. Optim., 2023)

The Zero Forcing Number of Quartic Circulant Graphs of Prime Order. - Huixian Li; Guang Li; Shengjin Ji (Ars Comb., 2024)

The zero forcing number of claw-free cubic graphs. - Mengya He; Huixian Li; Ning Song; Shengjin Ji (Discret. Appl. Math., 2024)

Some results on the saturation number of graphs. - Jinze Hu; Shengjin Ji; Chenke Zhang (Discret. Appl. Math., 2025)

The Saturation Number of Kp ∪ P3. - Jinze Hu; Shengjin Ji; Chenke Zhang (J. Interconnect. Networks, 2025)

$(K_{1} vee {P_{t})}$-saturated graphs with minimum number of edges. - Jinze Hu; Shengjin Ji; Qing Cui (J. Comb. Optim., 2025)

The Extremal Results for Forcing Problem of Trees. - Baoxin Li; Yahan Cao; Shengjin Ji (Graphs Comb., 2025)