𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Vertices of given degree in a random graph

✍ Scribed by Béla Bollobás

Publisher
John Wiley and Sons
Year
1982
Tongue
English
Weight
349 KB
Volume
6
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the number of vertices of given degre
On the number of vertices of given degree in a random graph
✍ Zbigniew Palka 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB 👁 1 views

This note can be treated a s a supplement to a paper written by Bollobas which was devoted to the vertices of a given degree in a random graph. We determine some values of the edge probability p for which the number of vertices of a given degree of a random graph G E ?An, p) asymptotically has a nor

Vertices of degree k in random unlabeled
Vertices of degree k in random unlabeled trees
✍ Konstantinos Panagiotou; Makrand Sinha 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 172 KB 👁 1 views

Let H n be the class of unlabeled trees with n vertices, and denote by H n a tree that is drawn uniformly at random from this set. The asymptotic behavior of the random variable deg k (H n ) that counts vertices of degree k in H n was studied, among others, by Drmota and Gittenberger in [J Graph The

Diameter of random spanning trees in a g
Diameter of random spanning trees in a given graph
✍ Fan Chung; Paul Horn; L. Lu 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 1 views

## Abstract Motivated by the observation that the sparse tree‐like subgraphs in a small world graph have large diameter, we analyze random spanning trees in a given host graph. We show that the diameter of a random spanning tree of a given host graph __G__ is between and with high probability., w

Vertices of Small Degree in Uniquely Ham
Vertices of Small Degree in Uniquely Hamiltonian Graphs
✍ J.A. Bondy; Bill Jackson 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 206 KB

Let G be a uniquely hamiltonian graph on n vertices. We show that G has a vertex of degree at most c log 2 8n+3, where c=(2&log 2 3) &1 r2.41. We show further that G has at least two vertices of degree less than four if it is planar and at least four vertices of degree two if it is bipartite.

The distribution of nodes of given degre
The distribution of nodes of given degree in random trees
✍ Drmota, Michael; Gittenberger, Bernhard 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 391 KB 👁 2 views

Let T n denote the set of unrooted unlabeled trees of size n and let k ≥ 1 be given. By assuming that every tree of T n is equally likely, it is shown that the limiting distribution of the number of nodes of degree k is normal with mean value ∼ µ k n and variance ∼ σ 2 k n with positive constants µ