On the maximum forcing and anti-forcing numbers of (4, 6)-fullerenes. - Lingjuan Shi; Hongwei Wang; Heping Zhang (Discret. Appl. Math., 2017)

Tight upper bound on the maximum anti-forcing numbers of graphs. - Lingjuan Shi; Heping Zhang (Discret. Math. Theor. Comput. Sci., 2017)

Counting Clar structures of (4, 6)-fullerenes. - Lingjuan Shi; Heping Zhang (Appl. Math. Comput., 2019)

Characterizing the fullerene graphs with the minimum forcing number 3. - Lingjuan Shi; Heping Zhang; Ruizhi Lin (Discret. Appl. Math., 2021)

The anti-forcing spectra of (4, 6)-fullerenes. - Lingjuan Shi; Heping Zhang; Lifang Zhao (Appl. Math. Comput., 2022)

A note on hamiltonian cycles in 4-tough (P2 ∪ kP1)-free graphs. - Lingjuan Shi; Songling Shan (Discret. Math., 2022)

The fullerene graphs with a perfect star packing. - Lingjuan Shi (Ars Math. Contemp., 2022)

Counting the maximal and perfect matchings in benzenoid chains. - Lingjuan Shi; Kai Deng (Appl. Math. Comput., 2023)