A general framework is developed for deriving sharp inequalities on simple graphs from majorization and Schur-convexity. After establishing majorization relations between the spectrum of an arbitrary graph and the spectra of the complete, complete bipartite, and matching graphs, it is shown that every positive Schur-convex spectral functional yields several sharp inequalities relating $λ_1$, $|λ_n|$, and $\|G\|_\ast$. This reduces the problem of proving graph inequalities to the choice of a suitable Schur-convex function. This optimization problem is then studied within the family of random vector norms, whose moment and cumulant expansions connect the framework to the numbers of closed walks. This yields new sharp results, recovers classical inequalities from a unified viewpoint, and produces further bounds in settings such as triangle-free and square-free graphs.