𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cataloging graphs by generating them uniformly at random

✍ Scribed by A. Kerber; R. Laue; R. Hager; W. Weber


Publisher
John Wiley and Sons
Year
1990
Tongue
English
Weight
254 KB
Volume
14
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

We describe an algorithm for cataloging graphs by generating them uniformly at random. The method used is based on a recent algorithm by Dixon and Wilf that generates orbit representatives uniformly at random. The approach is refined to graphs with prescribed numbers of edges and vertices, and then applied to obtain the complete list of graphs on 10 vertices.


📜 SIMILAR VOLUMES


Random graphs generated by the Star 2-Pr
✍ Hanna Robalewska 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 249 KB

The star 2-process ''greedily'' generates graphs with maximum degree 2 in a natural way. We can obtain information about the final graph of this process; for instance, that is almost surely 2-regular. We also find the probability of hamiltonicity and Poisson approximations of the distributions of nu

Connectivity of random regular graphs ge
✍ Pu Gao 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB 👁 1 views

## Abstract We study the connectivity of random __d__‐regular graphs which are recursively generated by an algorithm motivated by a peer‐to‐peer network. We show that these graphs are asymptotically almost surely __d__‐connected for any even constant __d__⩾4. © 2010 Wiley Periodicals, Inc. J Graph