✦ LIBER ✦

Convexity of degree sequences

✍ Scribed by Anstee, R. P.; Nam, Yunsun

Publisher: John Wiley and Sons
Year: 1999
Tongue: English
Weight: 127 KB
Volume: 30
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(199902)30:2<147::aid-jgt8>3.0.co;2-c

No coin nor oath required. For personal study only.

✦ Synopsis

We explore the convexity of the set of vectors consisting of degree sequences of subgraphs of a given graph. Results of Katerinis and Fraisse, Hell and Kirkpatrick concerning vertex deleted f -factors are generalized.

📜 SIMILAR VOLUMES

Signed degree sequences of signed graphs

✍ Yan, Jing-Ho; Lih, Ko-Wei; Kuo, David; Chang, Gerard J. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 105 KB 👁 1 views

sequence to be the signed degree sequence of a signed graph or a signed tree, answering a question raised by

Degree sequences of graphs and dominance

Degree sequences of graphs and dominance order

✍ Triesch, Eberhard 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 271 KB 👁 2 views

Suppose that the graphical partition H(A) = (a: 2 . . . 2 a:) arises from A = (al 2 . . . 2 a,) by deleting the largest summand a1 from A and reducing the a1 largest of the remaining summands by one. Let (a;+l 2 . . 2 ah) = H ( A ) denote the partition obtained by applying the operator H i times. We

The smallest degree sum that yields pote

The smallest degree sum that yields potentiallyPk-graphical sequences

✍ Jiong-Sheng, Li; Zi-Xia, Song 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 354 KB 👁 1 views

A simple graph G is said to have property P k if it contains a complete subgraph of order k + 1, and a sequence π is potentially P k -graphical if it has a realization having property P k . Let σ(k, n) denote the smallest degree sum such that every n-term graphical sequence π without zero terms and

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

On low bound of degree sequences of span

On low bound of degree sequences of spanning trees inK-edge-connected graphs

✍ Zhenhong, Liu; Baoguang, Xu 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 257 KB 👁 3 views

[•] is a lower integer form and α depends on k. We show that every k-edge-connected graph with k ≥ 2, has a d k -tree, and α = 1 for k = 2, α = 2 for k ≥ 3.

Probabilistic analysis of column-convex

Probabilistic analysis of column-convex and directed diagonally-convex animals

✍ G. Louchard 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 315 KB

Using asymptotic analysis of generating functions, we consider stochastic properties of parameters of some directed animals. For column-convex animals and directed diagonally-convex animals with fixed large area, we obtain asymptotic distribution for the number of columns and the size of a column. W