100 search results - page 1 / 20 » Unicyclic Components in Random Graphs |
CORR
2004
Springer
13 years 4 months ago
2004
Springer
EJC
2006
13 years 5 months ago
2006
We find the asymptotic number of connected graphs with k vertices and k - 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the pro...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We consider random walks on two classes of random graphs and explore the likely structure of the vacant set viz. the set of unvisited vertices. Let (t) be the subgraph induced by ...
CPC
2010
13 years 2 months ago
2010
We study the diameter of C1, the largest component of the Erdos-R
WAW
2007
Springer
13 years 11 months ago
2007
Springer
The geographical threshold graph model is a random graph model with nodes distributed in a Euclidean space and edges assigned through a function of distance and node weights. We st...