Ononot — Consider the graph G obtained by taking a K4 and adding one

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

Graph Theoryhard

0:00.0

Consider the graph $G$ obtained by taking a $K_4$ and adding one pendant vertex to every original vertex. What is the number of edges in $G$ ?