Let G be a simple undirected graph with n vertices such that any pair of its vertices is connected by exactly one path. How many cut edges does G have?
1
1
2
\(\frac{⌊n}{2⌋}\)
3
n – 1
4
n
Let G be a simple undirected graph with n vertices such that any pair of its vertices is connected by exactly one path. How many cut edges does G have?
1
\(\frac{⌊n}{2⌋}\)
n – 1
n