Lingjuan Shi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Lingjuan Shi has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Binlong Li
School of Mathematics and Statistics, Northwestern Polytechnical University, Xi’an, People’s Republic of China
1 shared publication Chengqi Li
1 shared publication- Heping Zhang
School of Mathematics and Statistics Lanzhou University Lanzhou China
1 shared publication Jinhui Yin
1 shared publicationKai Deng
1 shared publicationLifang Zhao
1 shared publication
Latest Publications
- 5 November 2025
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 380, 480-491
The number of maximal matchings in polygon rings
- 5 November 2025
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 380, 480-491
The number of maximal matchings in polygon rings
- Open Access
A note on two cycles of consecutive even lengths in graphs
Bondy and Vince proved that a graph of minimum degree at least three contains two cycles whose lengths differ by one or two, which was conjectured by Erdős. Gao, Li, Ma and Xie gave an average degree counterpart of Bondy-Vince's result, stating that every $n$-vertex graph with at least $\frac{5}{2}(n-1)$ edges contains two cycles of consecutive even lengths, unless $4|(n-1)$ and every block of $G$ is a clique $K_5$. This confirms the case $k=2$ of Verstraëte's conjecture, which states that every $n$-vertex graph without $k$ cycles of consecutive even lengths has edge number $e(G)\leq\frac{1}{2}(2k+1)(n-1)$, with equality if and only if every block of $G$ is a clique of order $2k+1$. Sudakov and Verstraëte further conjectured that if $G$ is a graph with maximum number of edges that does not contain $k$ cycles of consecutive even lengths, then every block of $G$ is a clique of order at most $2k+1$. In this paper, we prove the case $k=2$ for Sudakov-Verstraëte's conjecture, by extending the results of Gao, Li, Ma and Xie.Open AccessA note on two cycles of consecutive even lengths in graphs
Bondy and Vince proved that a graph of minimum degree at least three contains two cycles whose lengths differ by one or two, which was conjectured by Erdős. Gao, Li, Ma and Xie gave an average degree counterpart of Bondy-Vince's result, stating that every $n$-vertex graph with at least $\frac{5}{2}(n-1)$ edges contains two cycles of consecutive even lengths, unless $4|(n-1)$ and every block of $G$ is a clique $K_5$. This confirms the case $k=2$ of Verstraëte's conjecture, which states that every $n$-vertex graph without $k$ cycles of consecutive even lengths has edge number $e(G)\leq\frac{1}{2}(2k+1)(n-1)$, with equality if and only if every block of $G$ is a clique of order $2k+1$. Sudakov and Verstraëte further conjectured that if $G$ is a graph with maximum number of edges that does not contain $k$ cycles of consecutive even lengths, then every block of $G$ is a clique of order at most $2k+1$. In this paper, we prove the case $k=2$ for Sudakov-Verstraëte's conjecture, by extending the results of Gao, Li, Ma and Xie. - 22 February 2023
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 447
Counting the maximal and perfect matchings in benzenoid chains
- 22 February 2023
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 447
Counting the maximal and perfect matchings in benzenoid chains
- 20 July 2022
- Published by Elsevier in Discrete Mathematics
- Vol. 345 (12)
A note on hamiltonian cycles in 4-tough (P2 ∪ kP1)-free graphs
- 20 July 2022
- Published by Elsevier in Discrete Mathematics
- Vol. 345 (12)
A note on hamiltonian cycles in 4-tough (P2 ∪ kP1)-free graphs
- 31 March 2022
- Published by University of Primorska Press in Ars Mathematica Contemporanea
- Vol. 23 (1)
The fullerene graphs with a perfect star packing
Fullerene graph G is a connected plane cubic graph with only pentagonal and hexagonal faces, which is the molecular graph of carbon fullerene. A spanning subgraph of G is called a perfect star packing in G if its each component is isomorphic to K1, 3. For an independent set D ⊆ V(G), if each vertex in V(G) \ D has exactly one neighbor in D, then D is called an efficient dominating set of G. In this paper we show that the number of vertices of a fullerene graph admitting a perfect star packing must be divisible by 8. This answers an open problem asked by Došlić et al. and also shows that a fullerene graph with an efficient dominating set has 8n vertices. In addition, we find some counterexamples for the necessity of Theorem 14 in and list some subgraphs that preclude the existence of a perfect star packing of type P0.
- 31 March 2022
- Published by University of Primorska Press in Ars Mathematica Contemporanea
- Vol. 23 (1)
The fullerene graphs with a perfect star packing
Fullerene graph G is a connected plane cubic graph with only pentagonal and hexagonal faces, which is the molecular graph of carbon fullerene. A spanning subgraph of G is called a perfect star packing in G if its each component is isomorphic to K1, 3. For an independent set D ⊆ V(G), if each vertex in V(G) \ D has exactly one neighbor in D, then D is called an efficient dominating set of G. In this paper we show that the number of vertices of a fullerene graph admitting a perfect star packing must be divisible by 8. This answers an open problem asked by Došlić et al. and also shows that a fullerene graph with an efficient dominating set has 8n vertices. In addition, we find some counterexamples for the necessity of Theorem 14 in and list some subgraphs that preclude the existence of a perfect star packing of type P0.
- 22 March 2022
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 425
The anti-forcing spectra of -fullerenes- 22 March 2022
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 425
The anti-forcing spectra of -fullerenes