Vertex Degree of Random Intersection Graph

Simple item page
dc.creatorGupta, Bhupendra
dc.date2008-09-06
dc.date.accessioned2026-07-07T10:01:16Z
dc.date.available2026-07-07T10:01:16Z
dc.descriptionA random intersection graph is constructed by independently assigning a subset of a given set of objects $W,$ to each vertex of the vertex set $V$ of a simple graph $G.$ There is an edge between two vertices of $V,$ iff their respective subsets(in $W$,) have at least one common element. The strong threshold for the connectivity between any two arbitrary vertices of vertex set $V,$ is derived. Also we determine the almost sure probability bounds for the vertex degree of a typical vertex of graph $G.$
dc.identifierhttps://arxiv.org/abs/0809.1141
dc.identifierhttp://arxiv.org/abs/0809.1141
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/168575
dc.subjectProbability
dc.titleVertex Degree of Random Intersection Graph
dc.typetext

Files

Collections

arXiv