2 papers
math.CO2024
The maximum number of maximum dissociation sets in potted graphs
Zejun Huang, Xinwei Zhang
A potted graph is a unicyclic graph such that its cycle contains a unique vertex with degree larger than 2. Given a graph , a subset of is a dissociation set of if it…
math.CO2023
Connected graphs with a given dissociation number attaining the minimum spectral radius
Zejun Huang, Jiahui Liu, Xinwei Zhang
A dissociation set of a graph is a set of vertices which induces a subgraph with maximum degree less than or equal to one. The dissociation number of a graph is the maximum cardina…