Lingjuan Shi

activity

20172022

most citedTight upper bound on the maximum anti-forcing numbers of graphs

13 citations · 13 across the 4 of their papers we have counts for

collaborators

4 papers

math.CO2022

A note on hamiltonian cycles in $4$ -tough $(P_{2} \cup k P_{1})$ -free graphs

Lingjuan Shi, Songling Shan

Let $t > 0$ be a real number and $G$ be a graph. We say $G$ is $t$ -tough if for every cutset $S$ of $G$ , the ratio of $∣ S ∣$ to the number of components of $G - S$ is at least $t$ . The…

math.CO2021

The fullerenes with a perfect star packing

Ling-Juan Shi

A spanning subgraph of a graph $G$ is called a perfect star packing in $G$ if every component of the spanning subgraph is isomorphic to the star graph $K_{1, 3}$ . An efficient domin…

math.CO2018

Characterizing the fullerene graphs with the minimum forcing number 3

Lingjuan Shi, Heping Zhang, Ruizhi Lin

The minimum forcing number of a graph $G$ is the smallest number of edges simultaneously contained in a unique perfect matching of $G$ . Zhang, Ye and Shiu \cite{HDW} showed that th…

math.CO2017★ 13 cited

Tight upper bound on the maximum anti-forcing numbers of graphs

Lingjuan Shi, Heping Zhang

Let $G$ be a simple graph with a perfect matching. Deng and Zhang showed that the maximum anti-forcing number of $G$ is no more than the cyclomatic number. In this paper, we get a…

A note on hamiltonian cycles in 4-tough (P2​∪kP1​)-free graphs

The fullerenes with a perfect star packing

Characterizing the fullerene graphs with the minimum forcing number 3

Tight upper bound on the maximum anti-forcing numbers of graphs

A note on hamiltonian cycles in $4$ -tough $(P_{2} \cup k P_{1})$ -free graphs