Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent posts tagged pgee-2021
1
GATE 2.0 (PGEE 2021)
In each tree we have k-1 edges for k vertices. So, for t trees with total n vertices (all trees are disconnected in a forest) we would have n-t edges.
Hira Thakur
4,601
views
Hira Thakur
posted
Feb 19, 2021
Exam Application
iiith-pgee
pgee-2021
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register