SCOPUS 정보 검색 플랫폼

Volumn 27, Issue 8 SPEC. ISS., 2006, Pages 1294-1320

Counting connected graphs asymptotically

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33748573619 PISSN: 01956698 EISSN: None Source Type: Journal
DOI: 10.1016/j.ejc.2006.05.006 Document Type: Article

Times cited : (20)

References (13)

1
- 33748545025
- N. Arora, J. Spencer, Generating Random Connected Graphs, 2006 (preprint)

3
- 84990723730
- The asymptotic number of labeled connected graphs with a given number of vertices and edges
- Bender E., Rodney Canfield E., and McKay B.D. The asymptotic number of labeled connected graphs with a given number of vertices and edges. Random Structures Algorithms 2 (1990) 127-169
- (1990) Random Structures Algorithms , vol.2 , pp. 127-169
- Bender, E.¹ Rodney Canfield, E.² McKay, B.D.³

4
- 35048881982
- A. Coja-Oghlan, C. Moore, V. Sanwalani, Counting connected graphs and hypergraphs via the probabilistic method, in: Proc. 8th Intl. Workshop on Randomization and Computation, RANDOM'04, pp. 322-333

5
- 0001847481
- On the evolution of random graphs
- Erdo{double acute}s P., and Rényi A. On the evolution of random graphs. Magyar Tud. Akad. Mat. Kutató Int. Közl. 5 (1960) 17-61
- (1960) Magyar Tud. Akad. Mat. Kutató Int. Közl. , vol.5 , pp. 17-61
- Erdos, P.¹ Rényi, A.²

6
- 33748570204
- R. van der Hofstad, J. Spencer, The number of edges and vertices of the giant component (in preparation)

7
- 0021625402
- The Brownian excursion: A numerical analysis
- Louchard G. The Brownian excursion: A numerical analysis. Comput. Math. Appl. 10 (1984) 413-417
- (1984) Comput. Math. Appl. , vol.10 , pp. 413-417
- Louchard, G.¹

8
- 84990642302
- On the number of sparse connected graphs
- Łuczak T. On the number of sparse connected graphs. Random Structures Algorithms 2 (1990) 171-173
- (1990) Random Structures Algorithms , vol.2 , pp. 171-173
- Łuczak, T.¹

9
- 12944257224
- Counting connected graphs inside-out
- Pittel B., and Wormald N.C. Counting connected graphs inside-out. J. Combin. Theory Ser. B 93 2 (2005) 127-172
- (2005) J. Combin. Theory Ser. B , vol.93 , Issue.2 , pp. 127-172
- Pittel, B.¹ Wormald, N.C.²

10
- 0001097122
- On connected graphs I
- Rényi A. On connected graphs I. Publ. Math. Inst. Hungarian Acad. Sci. 4 159 (1959) 385-388
- (1959) Publ. Math. Inst. Hungarian Acad. Sci. , vol.4 , Issue.159 , pp. 385-388
- Rényi, A.¹

11
- 0007508170
- Enumerating graphs and Brownian motion
- Spencer J. Enumerating graphs and Brownian motion. Comm. Pure Appl. Math. 50 (1997) 293-296
- (1997) Comm. Pure Appl. Math. , vol.50 , pp. 293-296
- Spencer, J.¹

12
- 0001886010
- The number of connected sparsely edges graphs
- Wright E.M. The number of connected sparsely edges graphs. J. Graph Theory 1 (1977) 317-330
- (1977) J. Graph Theory , vol.1 , pp. 317-330
- Wright, E.M.¹

13
- 0007033389
- The number of connected sparsely edges graphs. III
- Wright E.M. The number of connected sparsely edges graphs. III. J. Graph Theory 4 (1980) 393-407
- (1980) J. Graph Theory , vol.4 , pp. 393-407
- Wright, E.M.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.