Evolutionary Dynamics of Complex Communications Networks

i

i

“K15155” — 2013/9/10 — 9:05

i

i

i

i

i

i

64 Evolutionary Dynamics of Complex Communications Networks

Table 2.1: Graph theory notation.

Symbol Definition

n order (number of vertices) of G(V, E) (n = |V |)

m size (number of edges) of G(V, E) (m = |E|)

A = A(G) adjacency matrix of G(V, E)

α(G) independence number of G(V, E)

B = B(G) incidence matrix of G(V, E)

C(s) cover time

C(x, y) mean commute time between vertices x-y

χ(G) chromatic (vertex) number of G(V, E)

χ

0

(G) edge chromatic number of G(V, E)

∆ maximum node degree of G(V, E)

δ minimum node degree of G(V, E)

diam(G) diameter of of G(V, E)

E(U, W ) set of U-W edges

E(G) set of edges of G(V, E)

H(ω) Hamiltonian ...