✦ LIBER ✦

Asymptotic formulas for the number of oriented graphs

✍ Scribed by E.M Wright

Publisher: Elsevier Science
Year: 1978
Tongue: English
Weight: 158 KB
Volume: 24
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(78)90058-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An asymptotic formula for the number of

An asymptotic formula for the number of graphs having small diameter

✍ Ioan Tomescu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 351 KB

In this paper it is shown that for every fixed k 1> 3, G(n; d = k) = 2(~) (6.2 -k + o(1))", where G(n; d = k) denotes the number of graphs of order n and diameter equal to k. It is also proved that for every fixed k>~2, lim,~G(n;d=k)/G(n;d=k+ 1)=lim.o~G(n;d=n-k)/ G(n;d=n-k+ 1)= oo hold.

The chromatic number of oriented graphs

✍ Sopena, Eric 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 198 KB 👁 2 views

We introduce in this paper the notion of the chromatic number of an oriented graph G (that is of an antisymmetric directed graph) defined as the minimum order of an oriented graph H such that G admits a homomorphism to H. We study the chromatic number of oriented k-trees and of oriented graphs with

Formulas for the number of trees in cert

Formulas for the number of trees in certain incomplete graphs

✍ S.D. Bedrosian 📂 Article 📅 1970 🏛 Elsevier Science 🌐 English ⚖ 192 KB

A concise summary is given of the standardized incomplete graphs denoted as the r, p, m and s series. Bercovici's recent general formula for the number of trees in the m series is considered and the corresporLdin,g gen,eral formula for the s series is given.

An Asymptotic Formula for the Number of

An Asymptotic Formula for the Number of Complete Propositional Connectives

✍ Roger F. Wheeler 📂 Article 📅 1962 🏛 John Wiley and Sons 🌐 English ⚖ 205 KB

The present article is really a continuation of the author's earlier paper [,l] on this subject. The line of investigation described previously is rounded off by deriving some further numcrical results, which include, in particular, an asymptotic fonnula for the number of complete propositional conn

Lehmer numbers and an asymptotic formula

Lehmer numbers and an asymptotic formula for π

✍ Shigeki Akiyama 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 141 KB

The Geodetic Number of an Oriented Graph

✍ Gary Chartrand; Ping Zhang 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 149 KB

For two vertices u and v of an oriented graph D, the set I (u, v) consists of all vertices lying on a uv geodesic or vu geodesic in D. If S is a set of vertices of D, then I (S) is the union of all sets I (u, v) for vertices u and v in S. The geodetic number g(D) is the minimum cardinality among the