Given the number of vertices and the number of edges in a class of graphs, the size and the structure of the minimum maximum component of graphs are studied, through which some significant results are obtained. The obtained results provide a theoretical foundation for the application of the minimum maximum component.