To find the maximum number of edges in a disconnected graph, consider that removing the fewest number of edges while ensuring the graph remains disconnected is optimal. The simplest form of disconnection involves one component containing the maximum number of vertices possible without encompassing all vertices. Let one component have 9 vertices and the other 1 to ensure disconnection. The maximum number of edges in the 9-vertex component is given by: 9(9-1)/2=36.
No edges exist between the separate components.
Thus, the maximum number of edges ensuring the graph remains disconnected is 36.
In the diagram, the lines QR and ST are parallel to each other. The shortest distance between these two lines is half the shortest distance between the point P and the line QR. What is the ratio of the area of the triangle PST to the area of the trapezium SQRT?
Note: The figure shown is representative
