BA |
Barabasi-Albert |
n in [100,500,1000], number of edges m per node in [1,3,5,7,9] |
ER |
Erdos-Renyi |
n in [100,500,1000], edge probability p in [0.01,0.02,0.03,0.04,0.05] |
WS |
Watt-Strogatz |
n in [100,500,1000], ring size k in [3,5,7,9], rewiring probability p = [0.1,0.4,0.7] |
RG |
Regular graphs |
n in [100,500,1000], node degree d in [3,4,5] |
GG |
Grid graphs |
Side length d in [5,10,15,20,25,30] |
PG |
Path graphs |
n in [100,500,1000] |
CG |
Circle graphs |
n in [100,500,1000] |
WG |
Wheel graphs |
n in [100,500,1000] |
LG |
Ladder graphs |
n in [100,500,1000] |
BT |
Binary trees |
Branching factor r in [2,3], height of tree h in [3,4] |
HG |
Hypercube graphs |
Dimension d in [2,3,4,5,6,7,8] |
BG |
Barbell graphs |
Bell size m1 in [5,10,15,20], path length m2 in [5,10,15,20] |