2 citations · 2 across the 3 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2019
The complexity of total edge domination and some related results on trees
Zhuo Pan, Yu Yang, Xianyue Li +1
For a graph with vertex set and edge set , a subset of is called an (resp. a ) if every e…
math.CO2017★ 2 cited
On anti-Kekulé and -restricted matching preclusion problems
Huazhong Lü, Xianyue Li, Heping Zhang
The anti-Kekulé number of a connected graph is the smallest number of edges whose deletion results in a connected subgraph having no Kekulé structures (perfect matchings). As a…