3 papers
math.CO2021
On the maximum number of maximum dissociation sets in trees with given dissociation number
Jianhua Tu, Lei Zhang, Junfeng Du
In a graph , a subset of vertices is a dissociation set if it induces a subgraph with vertex degree at most 1. A maximum dissociation set is a dissociation set of maximum cardin…
math.CO2021
Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree
Jianhua Tu, Lei Zhang, Junfeng Du +1
In a graph G, a dissociation set is a subset of vertices which induces a subgraph with vertex degree at most 1. Finding a dissociation set of maximum cardinality in a graph is NP-h…
math.CO2020
Maximum dissociation sets in subcubic trees
Lei Zhang, Jianhua Tu, Chunlin Xin
A subset of vertices in a graph is called a maximum dissociation set if it induces a subgraph with vertex degree at most 1 and the subset has maximum cardinality. The dissociat…