5 citations · 17 across the 7 of their papers we have counts for
4 papers · 1 filter
Paired domination in trees: A linear algorithm and asymptotic normality
Michael A. Henning, Dimbinaina Ralaivaosaona
A set of vertices in a graph is a paired dominating set if every vertex of is adjacent to a vertex in and the subgraph induced by contains a perfect matching (n…
The birth of the strong components
Sergey Dovgal, Élie de Panafieu, Dimbinaina Ralaivaosaona +2
Random directed graphs undergo a phase transition around the point , and the width of the transition window has been known since the works of Luczak and Seierstad…
A central limit theorem for almost local additive tree functionals
Dimbinaina Ralaivaosaona, Matas Šileikis, Stephan Wagner
An additive functional of a rooted tree is a functional that can be calculated recursively as the sum of the values of the functional over the branches, plus a certain toll functio…
Additive functionals of -ary increasing trees
Dimbinaina Ralaivaosaona, Stephan Wagner
A tree functional is called additive if it satisfies a recursion of the form , where are the branches of the tree and …