In a ConnectedGraph with n-vertices having maximal set of vertices such that any two vertices in the set are strongly connected(mutually reachable), then we get:
No. of neighbours for any given vertex=(n-1), degree=(n-1).
By adding another edge to this it doesnt change the strength of the graph.
Ans: A,D