\(G\) is an undirected graph with \(n\) vertices and 25 edges such that each…

PYQ GATE 2017

GG  is an undirected graph with nn vertices and 25 edges such that each vertex of GG has degree at least 3. Then the maximum possible value of nn is _________ .

Attempted by 293 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…