On Vertex, Edge, and Vertex-Edge Random Graphs
2011 (English)In: The Electronic Journal of Combinatorics, ISSN 1077-8926, Vol. 18, no 1, P110- p.Article in journal (Refereed) Published
We consider three classes of random graphs: edge random graphs, vertex random graphs, and vertex-edge random graphs. Edge random graphs are Erdos-Renyi random graphs, vertex random graphs are generalizations of geometric random graphs, and vertex-edge random graphs generalize both. The names of these three types of random graphs describe where the randomness in the models lies: in the edges, in the vertices, or in both. We show that vertex-edge random graphs, ostensibly the most general of the three models, can be approximated arbitrarily closely by vertex random graphs, but that the two categories are distinct.
Place, publisher, year, edition, pages
2011. Vol. 18, no 1, P110- p.
Engineering and Technology
IdentifiersURN: urn:nbn:se:uu:diva-154299ISI: 000290556900002OAI: oai:DiVA.org:uu-154299DiVA: diva2:419881