Textbook in PDF format
Motivation
Network
Adjacency matrix
Undirected networks
Self-loops
Weighted networks
Node degrees
Weighted node degree
Visualizing networks
Walks, paths, and cycles
Powers of adjacency matrices
Topological distance
Finding shortest paths
Connected components
From components to communities
Community detection
Vertex cuts and vertex connectivity
Menger`s theorem
Edge cuts and normalized cut size
Laplacian matrix
Algebraic connectivity
Fiedler vector
Spectral clustering