Basic Concepts in Graph Theory

A path is a connected graph.

• TRUE

• FALSE

• TRUE

• FALSE

A graph with n vertices and⁣ n edges must be connected.

• TRUE

• FALSE

A simple graph with 3 vertices and 3 edges is connected.

• TRUE

• FALSE

A simple graph with 5 vertices and 5 edges must be connected.

• TRUE

• FALSE

A graph with 4 vertices and 3 edges is a tree.

• TRUE

• FALSE

A connected graph with n vertices and n edges is a tree.

• TRUE

• FALSE

A graph with n vertices and n(n+1) edges must be connected.

• TRUE

• FALSE

A connected graph with n vertices and n-1 edges must be simple.

• TRUE

• FALSE

• TRUE

• FALSE