That's tricky!

For a simple graph \(G\) with at least two vertices, which of the following statements must be true?

Graph is called simple if it doesn't contain multiple edges between the same pair of nodes and no vertex has self-edges.

Note : The degree of a vertex is the number of connections it has.

×

Problem Loading...

Note Loading...

Set Loading...