diameters

the largest . To describe how well the network is connected

To find the diameter, take the adjacency matrix, add Identity matrix to it, and multiply it by itself. \((A+I)^k_{i,j}\) contains /number of ways to get from node \(i\) to node \(j\) with \(k\) movmentments, where each movement may move 0 or 1 step(as we have added the identity connections). When after a multiplication, the last 0 is gone, then \(k\) is the diameter