✦ LIBER ✦

The number of connected initial automata

✍ Scribed by V. A. Liskovets

Publisher: Springer US
Year: 1972
Tongue: English
Weight: 348 KB
Volume: 5
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01070908

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The connected hub number and the connect

The connected hub number and the connected domination number

✍ Peter Johnson; Peter Slater; Matt Walsh 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 189 KB

On the group of automorphisms of strongl

On the group of automorphisms of strongly connected automata

✍ Bruce H. Barnes 📂 Article 📅 1970 🏛 Springer 🌐 English ⚖ 464 KB

Asymptotic estimates of the number of fi

Asymptotic estimates of the number of finite automata

✍ A. D. Korshunov 📂 Article 📅 1969 🏛 Springer US 🌐 English ⚖ 386 KB

The expected number of pairs of connecte

The expected number of pairs of connected nodes: Pair-connected reliability

✍ A.T Amin; K.T Siegrist; P.J Slater 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 926 KB

Semigroups and automorphism groups of st

Semigroups and automorphism groups of strongly connected automata

✍ Kenji Uemura 📂 Article 📅 1974 🏛 Springer 🌐 English ⚖ 404 KB

The number of connected sparsely edged g

The number of connected sparsely edged graphs

✍ E. M. Wright 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 472 KB

## Abstract An (__n, q__) graph has __n__ labeled points, __q__ edges, and no loops or multiple edges. The number of connected (__n, q__) graphs is __f(n, q)__. Cayley proved that __f(n, n__^‐1^) = __n__^n−2^ and Renyi found a formula for __f(n, n)__. Here I develop two methods to calculate the exp