𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A degree sequence method for the cutwidth problem of graphs

✍ Scribed by Yixun Lin; Xianglu Li; Aifeng Yang

Book ID
107500550
Publisher
SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
Year
2002
Tongue
English
Weight
366 KB
Volume
17
Category
Article
ISSN
1005-1031

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Maximum cutwidth problem for graphs
Maximum cutwidth problem for graphs
✍ Jianxiu Hao πŸ“‚ Article πŸ“… 2003 πŸ› SP Editorial Committee of Applied Mathematics - A 🌐 English βš– 303 KB
A family of graphs and the degree/diamet
A family of graphs and the degree/diameter problem
✍ Geoffrey Exoo πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 64 KB πŸ‘ 1 views

## Abstract We investigate a family of graphs relevant to the problem of finding large regular graphs with specified degree and diameter. Our family contains the largest known graphs for degree/diameter pairs (3, 7), (3, 8), (4, 4), (5, 3), (5, 5), (6, 3), (6, 4), (7, 3), (14, 3), and (16, 2). We a

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