Maoqun Wang

collaborators

3 papers

math.CO2024

The minimum number of maximal dissociation sets in unicyclic graphs

Junxia Zhang, Xiangyu Ren, Maoqun Wang

A subset of vertices in a graph $G$ is considered a maximal dissociation set if it induces a subgraph with vertex degree at most 1 and it is not contained within any other dissocia…

math.CO2024

Tight Toughness and Isolated Toughness for ${K_{2}, C_{n}}$ -factor critical avoidable graph

Xiaxia Guan, Hongxia Ma, Maoqun Wang

A spannning subgraph $F$ of $G$ is a ${K_{2}, C_{n}}$ -factor if each component of $F$ is either $K_{2}$ or $C_{n}$ . A graph $G$ is called a $({K_{2}, C_{n}}, n)$ -factor critical avoidable…

math.CO2024

On the connected coalition number

Xiaxia Guan, Maoqun Wang

For a graph $G = (V, E)$ , a pair of vertex disjoint sets $A_{1}$ and $A_{2}$ form a connected coalition of $G$ , if $A_{1} \cup A_{2}$ is a connected dominating set, but neither $A_{1}$ …

The minimum number of maximal dissociation sets in unicyclic graphs

Tight Toughness and Isolated Toughness for {K2​,Cn​}-factor critical avoidable graph

On the connected coalition number

Tight Toughness and Isolated Toughness for ${K_{2}, C_{n}}$ -factor critical avoidable graph