Data Structures

1: The minimum number of edges in a connected cyclic graph on n vertices is

A.	n-1
B.	n
C.	n+1
D.	none of the above
	Answer : B Explanation : Write your comments here: Updating your Comments.. Updating your Comments.. Report Error
	Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here.

UGC NET Paper 1 UGC NET Computer Science UGC NET Exam GATE Exam Aptitude Viva Questions General Knowledge Computer Questions Online Test

Suggest an improvement