Ononot — A graph G has 10 vertices and 10 edges and is connected. It

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

Graph Theoryhard

0:00.0

A graph $G$ has 10 vertices and 10 edges and is connected. It contains exactly one cycle. What is this type of graph called?