𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs

✍ Scribed by Bollobás, Béla

Book ID
121989065
Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
347 KB
Volume
1
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An asymptotic formula for the number of
An asymptotic formula for the number of graphs having small diameter
✍ Ioan Tomescu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 351 KB

In this paper it is shown that for every fixed k 1> 3, G(n; d = k) = 2(~) (6.2 -k + o(1))", where G(n; d = k) denotes the number of graphs of order n and diameter equal to k. It is also proved that for every fixed k>~2, lim,~G(n;d=k)/G(n;d=k+ 1)=lim.o~G(n;d=n-k)/ G(n;d=n-k+ 1)= oo hold.

A formula for the number of labelled tre
A formula for the number of labelled trees
✍ Vites Longani 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 347 KB

Let L(n, r) be the number of labelled trees with n points and r end-points. In this paper it is shown that the number L(n, r) can be obtained from the formula