๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An asymptotic formula for the number of self-complementary labeled graphs

โœ Scribed by A. S. Ambrosimov

Publisher
SP MAIK Nauka/Interperiodica
Year
1984
Tongue
English
Weight
465 KB
Volume
35
Category
Article
ISSN
0001-4346

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.

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

The Asymptotic Number of Labeled Graphs
The Asymptotic Number of Labeled Graphs withnVertices,qEdges, and No Isolated Vertices
โœ Edward A Bender; E Rodney Canfield; Brendan D McKay ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 416 KB

Let d(n, q) be the number of labeled graphs with n vertices, q N=( n 2 ) edges, and no isolated vertices. Let x=qร‚n and k=2q&n. We determine functions w k t1, a(x), and .(x) such that d(n, q)tw k ( N q ) e n.(x)+a(x) uniformly for all n and q>nร‚2. 1997 Academic Press c(n, q)=u k \ N q + F(x) n A(x)