A language of nodes and links, degree and moments, and adjacency matrix and distance matrix, among others, is defined and used to capture the wide range of different types and properties of network topologies. Regular graphs and random graphs have fundamentally different connectivities that play a role in dynamic processes such as diffusion and synchronization on a network. Three common random graphs are the Erdös–Rényi (ER) graph, the small-world (SW) graph, and the scale-free (SF) graph. Random graphs give rise to critical phenomena based on static connectivity properties, such as the percolation threshold, but also exhibit dynamical thresholds for the diffusion of states across networks and the synchronization of oscillators. The vaccination threshold for diseases propagating on networks and the global synchronization transition in the Kuramoto model are examples of dynamical processes that can be used to probe network topologies.