Mathematics
The Adjacency Matrix and Graph Connectivity
Quick fact
If you square the adjacency matrix of a graph, the entry in row i and column j tells you exactly how many walks of length 2 exist from vertex i to vertex j.
Why this is interesting
Think of a network of friends. How can a single matrix hold the secret to who is connected to whom, and even how many ways you can reach someone in exactly two steps?