1 citations · 2 across the 2 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2009★ 3 cited
The connectivity-profile of random increasing k-trees
Alexis Darrasse, Hsien-Kuei Hwang, Olivier Bodini +1
Random increasing k-trees represent an interesting, useful class of strongly dependent graphs for which analytic-combinatorial tools can be successfully applied. We study in this p…
math.CO2007★ 1 cited
Distances in random Apollonian network structures
Olivier Bodini, Alexis Darrasse, Michèle Soria
In this paper, we study the distribution of distances in random Apollonian network structures (RANS), a family of graphs which has a one-to-one correspondence with planar ternary t…