1 citations · 1 across the 1 of their papers we have counts for
2 papers
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 is the smallest number of edges simultaneously contained in a unique perfect matching of . Zhang, Ye and Shiu \cite{HDW} showed that th…
math.CO2017★ 1 cited
Fractional matching preclusion number of graphs
Ruizhi Lin, Heping Zhang
Let be a graph with an even number of vertices. The matching preclusion number of , denoted by , is the minimum number of edges whose deletion leaves the resulting gr…