204 search results - page 4 / 41 » Packing vertices and edges in random regular graphs |
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 ...
ALGORITHMICA
2011
13 years 7 days ago
2011
We investigate the natural situation of the dissemination of information on various graph classes starting with a random set of informed vertices called active. Initially active ve...
CPC
2007
13 years 5 months ago
2007
Let G be a graph with no three independent vertices. How many edges of G can be packed with edge-disjoint copies of Kk? More specifically, let fk(n, m) be the largest integer t s...
JCT
2007
13 years 5 months ago
2007
The preferential attachment graph Gm(n) is a random graph formed by adding a new vertex at each time step, with m edges which point to vertices selected at random with probability...
CPC
2007
13 years 5 months ago
2007
We study a dynamically evolving random graph which adds vertices and edges using preferential attachment and is “attacked by an adversary”. At time t, we add a new vertex xt a...