The connectivity-profile of random increasing k-trees

Details The connectivity-profile of random increasing k-trees The connectivity-profile of random increasing k-trees

2009-10-19

arxiv.org/abs/0910.3639v1

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The connectivity-profile of random increasing k-trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The connectivity-profile of random increasing k-trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The connectivity-profile of random increasing k-trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-716556