We obtain several sharp spectral bounds, approximations, and exact values for the isoperimetric number and related edge-expansion parameters of graphs. Our results focus on graph powers and on families of graphs with rich algebraic or geometric structure, including distance-regular graphs and graphs arising from finite geometries, among others. Our proofs use techniques from spectral graph theory, linear optimization, finite geometry, and probability, yielding new machinery for analysing edge-expansion phenomena in highly structured graphs.