Connectivity of the uniform random intersection graph (Q1044989): Difference between revisions

@@ Property / author @@
-Stefanie Gerke
@@ Property / author: Stefanie Gerke / rank @@
-Normal rank
@@ Property / author @@
+Stefanie Gerke
@@ Property / author: Stefanie Gerke / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2008111483
@@ Property / OpenAlex ID: W2008111483 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.2814
@@ Property / arXiv ID: 0805.2814 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficiently covering complex networks with cliques of similar vertices
+Normal rank
@@ Property / cites work @@
+Component evolution in a secure wireless sensor network
+Normal rank
@@ Property / cites work @@
+Paths in graphs
@@ Property / cites work: Paths in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
+Normal rank
@@ Property / cites work @@
+The degree of a typical vertex in generalized random intersection graph models
+Normal rank
@@ Property / cites work @@
+The vertex degree distribution of random intersection graphs
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1044989