PEGASUS - Large Scale and Big Data: Processing and Management - page 280

(a)

120

HD

GCC
DC

100

80

60

40

20

Whiskers

0

5 0 15 20

Radius

25 30 35

(b)

8e+06

HD

GCC
DC

7e+06

6e+06

5e+06

4e+06

3e+06

2e+06

Whiskers

1e+06
0

5 105 0

Radius

25 30

(c)

30000

GCC
DC

HD

25000

20000

15000

10000

5000

Whiskers

0

2 468
Radius

10 12 14 16

FIGURE 8.21 Radius-degree plots of (a) Patent, (b) YahooWeb and (c) LinkedIn graphs.
HD represents the vertex with the highest degree. Notice that HD belongs to core vertices
inside the GCC, and whiskers have small degree.