3 citations · 4 across the 4 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
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 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
Counting Flows of -compatible Graphs
Houshan Fu, Xiangyu Ren, Suijie Wang
Kochol introduced the assigning polynomial to count nowhere-zero -flows of a graph , where is a finite Abelian group and is a -assigning from…