Name
Abstract | ||
|---|---|---|
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 paper a notion called connectivity-profile and derive
asymptotic estimates for it; some interesting consequences will also be given. |
Year | Venue | Field |
|---|---|---|
2010 | ANALCO | Graph,Random regular graph,Discrete mathematics,Combinatorics,Random graph,Mathematics |
DocType | Citations | PageRank |
Conference | 3 | 0.43 |
References | Authors | |
14 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexis Darrasse | 1 | 53 | 4.60 |
| Hsien-Kuei Hwang | 2 | 365 | 38.02 |
| Olivier Bodini | 3 | 82 | 22.10 |
| Michèle Soria | 4 | 153 | 16.97 |