✦ LIBER ✦

The number of strongly connected directed graphs

✍ Scribed by V. A. Liskovets

Publisher: SP MAIK Nauka/Interperiodica
Year: 1970
Tongue: English
Weight: 460 KB
Volume: 8
Category: Article
ISSN: 0001-4346
DOI: 10.1007/bf01673687

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On finding the strongly connected compon

On finding the strongly connected components in a directed graph

✍ Esko Nuutila; Eljas Soisalon-Soininen 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 499 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

The number of connected sparsely edged g

The number of connected sparsely edged graphs. IV large nonseparable graphs

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

The number of nonseparable graphs on n labeled points and q lines is u(n, 9). In the second paper of this series an exact formula for u(n, n + k) was found for general n and successive (small) k. The method would give an asymptotic approximation for fixed k as n + 30. Here an asymptotic approximatio

The w-median of a connected strongly cho

The w-median of a connected strongly chordal graph

✍ Hai-Yen Lee; Gerard J. Chang 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 337 KB 👁 1 views

## Abstract Suppose __G = (V, E)__ is a graph in which every vertex __x__ has a non‐negative real number __w(x)__ as its weight. The __w__‐distance sum of a vertex __y__ is __D~G, w~(y)__ = σ~x≅v~ __d(y, x)w(x).__ The __w__‐median of __G__ is the set of all vertices __y__ with minimum __w__‐distanc

The stability number and connected -fact

The stability number and connected -factor in graphs

✍ Jiansheng Cai; Guizhen Liu; Jianfeng Hou 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 365 KB

Let G be a graph with vertex set V (G). In this work we present a sufficient condition for the existence of connected [k, k + 1]factors in graphs. The condition involves the stability number and degree conditions of graph G.

The number of maximal independent sets i

The number of maximal independent sets in connected graphs

✍ Zoltán Füredi 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 286 KB 👁 2 views

Generalizing a theorem of Moon and Moser. we determine the maximum number of maximal independent sets in a connected graph on n vertices for n sufficiently large, e.g., n > 50. = I .32. . .). Example 1.2. Let b, = i(C,), where C,z denotes the circuit of length n. Then b, = 3, 6, = 2, b, = 5, and b,