35 citations · 156 across the 42 of their papers we have counts for
Showing 2017 · math.COShow all
2 papers · 2 filters
math.CO2017
On the forcing spectrum of generalized Petersen graphs P(n,2)
Shuang Zhao, Jinjiang Zhu, Heping Zhang
The forcing number of a perfect matching of a graph is the smallest cardinality of subsets of that are contained in no other perfect matchings of . The forcing spect…
math.CO2017★ 13 cited
Tight upper bound on the maximum anti-forcing numbers of graphs
Lingjuan Shi, Heping Zhang
Let be a simple graph with a perfect matching. Deng and Zhang showed that the maximum anti-forcing number of is no more than the cyclomatic number. In this paper, we get a…