Showing math.COShow all
2 papers · 1 filter
math.CO2026
On the Roots of Connected Domination Polynomials
Pingping Shao, Chengye Zhao
We determine the closure of the connected domination roots. The main tool is a substitution formula for the lexicographic product with a complete graph, $D_c(G[K_n],x)=D_c(G,(x+1)^…
math.CO2019
Linear algorithms on Steiner domination of trees
Yueming Shen, Chengye Zhao, Chenglin Gao +1
A set of vertices in a connected graph is called a Steiner dominating set if is both Steiner and dominating set. The Steiner domination number is the minimu…