Ononot — If a tree T has n vertices and exactly k leaves (n > 2), how

Guest Session: 1 Question Remaining. Create Account to save progress.

Graph Theorymedium

0:00.0

If a tree $T$ has $n$ vertices and exactly $k$ leaves ( $n > 2$ ), how many cut-vertices (articulation points) does it have?