메뉴 건너뛰기




Volumn 310, Issue 19, 2010, Pages 2560-2566

A random intersection digraph: Indegree and outdegree distributions

Author keywords

Clustering; Degree distribution; Random intersection digraph; Random intersection graph

Indexed keywords

CLUSTERING; DEGREE DISTRIBUTIONS; IN-DEGREE; OUTDEGREE; RANDOM INTERSECTION GRAPHS; RANDOM SUBSETS; VERTEX SET;

EID: 77955420479     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2010.06.018     Document Type: Article
Times cited : (9)

References (14)
  • 2
    • 0039648703 scopus 로고
    • Connection digraphs and second-order line digraphs
    • L.W. Beineke, and C. Zamfirescu Connection digraphs and second-order line digraphs Discrete Mathematics 39 1982 237 254
    • (1982) Discrete Mathematics , vol.39 , pp. 237-254
    • Beineke, L.W.1    Zamfirescu, C.2
  • 3
    • 67651171221 scopus 로고    scopus 로고
    • Connectivity of the uniform random intersection graph
    • S. Blackburn, and S. Gerke Connectivity of the uniform random intersection graph Discrete Mathematics 309 2009 5130 5140
    • (2009) Discrete Mathematics , vol.309 , pp. 5130-5140
    • Blackburn, S.1    Gerke, S.2
  • 4
    • 39749193846 scopus 로고    scopus 로고
    • Degree distribution of a typical vertex in a general random intersection graph
    • M. Bloznelis Degree distribution of a typical vertex in a general random intersection graph Lithuanian Mathematical Journal 48 2008 38 45
    • (2008) Lithuanian Mathematical Journal , vol.48 , pp. 38-45
    • Bloznelis, M.1
  • 5
    • 0004256573 scopus 로고
    • Adison-Wesley Reading, MA
    • L. Breiman Probability 1968 Adison-Wesley Reading, MA
    • (1968) Probability
    • Breiman, L.1
  • 8
    • 0034391563 scopus 로고    scopus 로고
    • Random intersection graphs when m = ωn: An equivalence theorem relating the evolution of the G(n, m, p) and G(n, p) models
    • J.A. Fill, E.R. Scheinerman, and K.B. Singer-Cohen Random intersection graphs when m = ω (n ) : an equivalence theorem relating the evolution of the G (n, m, p ) and G (n, p ) models Random Structures and Algorithms 16 2000 156 176
    • (2000) Random Structures and Algorithms , vol.16 , pp. 156-176
    • Fill, J.A.1    Scheinerman, E.R.2    Singer-Cohen, K.B.3
  • 11
    • 33747794115 scopus 로고    scopus 로고
    • The degree of a typical vertex in generalized random intersection graph models
    • J. Jaworski, M. Karoński, and D. Stark The degree of a typical vertex in generalized random intersection graph models Discrete Mathematics 306 2006 2152 2165
    • (2006) Discrete Mathematics , vol.306 , pp. 2152-2165
    • Jaworski, J.1    Karoński, M.2    Stark, D.3
  • 13
    • 33744963843 scopus 로고
    • Ph.D. Thesis, Department of Mathematical Sciences, The Johns Hopkins University
    • K.B. Singer-Cohen, Random intersection graphs, Ph.D. Thesis, Department of Mathematical Sciences, The Johns Hopkins University, 1995.
    • (1995) Random Intersection Graphs
    • Singer-Cohen, K.B.1
  • 14
    • 11144302612 scopus 로고    scopus 로고
    • The vertex degree distribution of random intersection graphs
    • D. Stark The vertex degree distribution of random intersection graphs Random Structures Algorithms 24 2004 249 258
    • (2004) Random Structures Algorithms , vol.24 , pp. 249-258
    • Stark, D.1


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