24 citations · 166 across the 22 of their papers we have counts for
Showing 2008Show all
2 papers · 1 filter
math.CO2008★ 16 cited
Upper bounds for alpha-domination parameters
Andrei Gagarin, Anush Poghosyan, Vadim E. Zverovich
In this paper, we provide a new upper bound for the alpha-domination number. This result generalises the well-known Caro-Roditty bound for the domination number of a graph. The sam…
math.CO2008★ 11 cited
Two-connected graphs with prescribed three-connected components
Andrei Gagarin, Gilbert Labelle, Pierre Leroux +1
We adapt the classical 3-decomposition of any 2-connected graph to the case of simple graphs (no loops or multiple edges). By analogy with the block-cutpoint tree of a connected gr…