3 citations · 3 across the 1 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2024
On independent domination and packing numbers of subcubic graphs
Xuqing Bai, Zhipeng Gao, Changqing Xi +1
In a recent paper, Cho and Kim proved that in subcubic graphs, the independent domination number is at most three times the packing number. They subsequently posed the question of…
math.CO2015★ 3 cited
Proper connection number and connected dominating sets
Xueliang Li, Meiqin Wei, Jun Yue
The proper connection number of a connected graph is defined as the minimum number of colors needed to color its edges, so that every pair of distinct vertices of i…