✦ LIBER ✦

Generating Random Regular Graphs

✍ Scribed by J. H. Kim; V. H. Vu*

Publisher: Springer-Verlag
Year: 2006
Tongue: English
Weight: 325 KB
Volume: 26
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s00493-006-0037-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generating and Counting Hamilton Cycles

Generating and Counting Hamilton Cycles in Random Regular Graphs

✍ Alan Frieze; Mark Jerrum; Michael Molloy; Robert Robinson; Nicholas Wormald 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 216 KB

Let G be chosen uniformly at random from the set G G r, n of r-regular graphs w x Ž . with vertex set n . We describe polynomial time algorithms that whp i find a Ž . Hamilton cycle in G, and ii approximately count the number of Hamilton cycles in G.

Generating r-regular graphs

✍ Guoli Ding; Peter Chen 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 208 KB

For each nonnegative integer r, we determine a set of graph operations such that all r-regular loopless graphs can be generated from the smallest r-regular loopless graphs by using these operations. We also discuss possible extensions of this result to r-regular graphs of girth at least g, for each

Generating 5-regular planar graphs

✍ Guoli Ding; Jinko Kanno; Jianning Su 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB

## Abstract For __k__=0, 1, 2, 3, 4, 5, let ${\cal{P}}\_{k}$ be the class of __k__ ‐edge‐connected 5‐regular planar graphs. In this paper, graph operations are introduced that generate all graphs in each ${\cal{P}}\_{k}$. © 2009 Wiley Periodicals, Inc. J Graph Theory 61: 219–240, 2009

Random strongly regular graphs?

✍ Peter J. Cameron 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 289 KB

Strongly regular graphs lie on the cusp between highly structured and unstructured. For example, there is a unique strongly regular graph with parameters (36; 10; 4; 2), but there are 32548 non-isomorphic graphs with parameters (36; 15; 6; 6). (The ÿrst assertion is a special case of a theorem of Sh

Random strongly regular graphs?

✍ Peter J. Cameron 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 203 KB

Random Matchings in Regular Graphs

✍ Jeff Kahn; Jeong Han Kim 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 339 KB