Consider the following diagram.

How many vertices are there?
How many edges are there?
What is the degree of each vertex?
| Vertex | Degree |
|---|---|
| $A$A | $\editable{}$ |
| $B$B | $\editable{}$ |
| $C$C | $\editable{}$ |
| $D$D | $\editable{}$ |
| $E$E | $\editable{}$ |
Is this graph connected?
No
Yes
Consider the following diagram.
Match the given graph with its equivalent planar representation.
Match the following graph with its equivalent planar representation.