Connected and Completed

Is the following graph complete?

• Yes

• No

Is the following graph complete?

• Yes

• No

Is the following graph connected?

• Yes

• No

Is the following graph connected?

• Yes

• No

In the graph above, which of the following statements is true?

• A is adjacent to E

• A is not adjacent to D

• C is adjacent to D

• C is not adjacent to E

Tags

CCSS.4.G.A.1

A complete graph has ...

• no isolated vertices

• no multiple edges

• each vertex connected to every other vertex

• no isolated vertices

A connected graph has ...

• no loops

• no multiple edges

• no isolated vertices

• each vertex connected to every other vertex

How many vertices does the graph contain?

• 2

• 3

• 4

• 5

How many edges does the graph contain?

• 5

• 6

• 7

• 8

What is the degree of vertex A?

• 2

• 3

• 4

• 5