23 search results - page 1 / 5 » Vertices of Degree k in Random Maps |
SODA
2010
ACM
14 years 2 months ago
2010
ACM
CORR
2011
Springer
13 years 9 days ago
2011
Springer
ABSTRACT. Upon the discovery of power laws [8, 16, 30], a large body of work in complex network analysis has focused on developing generative models of graphs which mimick real-wor...
ENDM
2002
13 years 5 months ago
2002
Let k be an integer and M be a closed 2-manifold with Euler characteristic (M) 0. We prove that each polyhedral map G on M with minimum degree and large number of vertices conta...
CPC
2006
13 years 5 months ago
2006
We give results for the age dependent distribution of vertex degree and number of vertices of given degree in the undirected web-graph process, a discrete random graph process int...
MICS
2010
13 years 3 months ago
2010
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...