✦ LIBER ✦

Extreme degrees in random graphs

✍ Scribed by Zbigniew Palka

Publisher: John Wiley and Sons
Year: 1987
Tongue: English
Weight: 448 KB
Volume: 11
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190110202

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graph Decompositions Satisfying Extremal

Graph Decompositions Satisfying Extremal Degree Constraints

✍ Paul A. Catlin 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 175 KB

## Abstract We show that the vertex set of any graph __G__ with __p__⩾2 vertices can be partitioned into non‐empty sets __V__~1~, __V__~2~, such that the maximum degree of the induced subgraph 〈__V__~i~〉 does not exceed where p^i^ = |__V__^i^|, for __i__=1, 2. Furthermore, the structure of the in

Vertices of given degree in a random gra

Vertices of given degree in a random graph

✍ Béla Bollobás 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 349 KB 👁 1 views

Extreme Values in FGM Random Sequences

✍ E Hashorva; J Hüsler 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 128 KB

We consider the multivariate Farlie Gumbel Morgenstern class of distributions and discuss their properties with respect to the extreme values. This class was used to consider dependence in multivariate distributions and their ordering. We show that the extreme values of these distributions behave as

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

The degree sequence of a random graph. I

The degree sequence of a random graph. I. The models

✍ Brendan D. McKay; Nicholas C. Wormald 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 246 KB 👁 2 views

We show that the joint distribution of the degrees of a random graph can be accurately approximated by several simpler models derived from a set of independent binomial distributions. On the one hand, we consider the distribution of degree sequences of 1 random graphs with n vertices and m edges. Fo

Extremal graphs in connectivity augmenta

Extremal graphs in connectivity augmentation

✍ Jord�n, Tibor 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 245 KB 👁 1 views

Let A(n, k, t) denote the smallest integer e for which every kconnected graph on n vertices can be made (k + t)-connected by adding e new edges. We determine A(n, k, t) for all values of n, k, and t in the case of (directed and undirected) edge-connectivity and also for directed vertex-connectivity