✦ LIBER ✦

Asymptotic enumeration of strongly connected digraphs by vertices and edges

✍ Scribed by Xavier Pérez-Giménez; Nicholas Wormald

Book ID: 112187395
Publisher: John Wiley and Sons
Year: 2012
Tongue: English
Weight: 311 KB
Volume: 43
Category: Article
ISSN: 1042-9832
DOI: 10.1002/rsa.20416

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Asymptotic enumeration of labeled multig

Asymptotic enumeration of labeled multigraphs by vertices, edges, and degree parities

✍ Edward A. Bender; L. Bruce Richmond 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 181 KB

We show that the number of labeled (n, q)-multigraphs with some specified p vertices of odd degree is asymptotically independent of p and is in fact asymptotically 2'-" times the number of (n, q)-multigraphs. We determine the asymptotic number of (n, q)-multigraphs.

Enumeration of unrooted orientable maps

Enumeration of unrooted orientable maps of arbitrary genus by number of edges and vertices

✍ Timothy R.S. Walsh; Alain Giorgetti; Alexander Mednykh 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 236 KB

The asymptotic number of rooted maps on

The asymptotic number of rooted maps on a surface.: II. Enumeration by vertices and faces

✍ Edward A Bender; E.Rodney Canfield; L.Bruce Richmond 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 436 KB

Bounding the size of the subgraph induce

Bounding the size of the subgraph induced by vertices and extra edge-connectivity of hypercubes

✍ Li, Hao; Yang, Weihua 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 369 KB