Graph Theory and Applications

The chromatic number of the graph is-------------

• four

• six

• three

• five

The set of non adjacent vertices is called--------------set

• Independent

• vertex cover

• matching

• clique

What is the chromatic number of the tree?

• 7

• 6

• 2

• 1

A _______________ of a graph colors vertices k colors so that adjacent vertices are different color.

• chromatic number

• graph coloring

• k-coloring

• vertex coloring

The smallest number of colors needed to color a graph is called the ______________________.

• chromatic number

• graph coloring

• k-coloring

• vertex coloring

In a complete graph, the chromatic number is ____________.

• 2

• 3

• the number of edges

• the number of vertices

What is the chromatic number of this graph?

• 2

• 3

• 4

• 5

What is the chromatic number of this graph?

• 2

• 3

• 4

• 5

The edge chromatic number of a graph is the:

• Total number of edges in the graph.
• Maximum number of colors needed to color the edges of a graph.
• Minimum number of colors needed to color the edges of a graph.
• Minimum number of colors needed to color the vertices of a graph.

Which of the following graphs is always 4-edge-chromatic?

• • K4​

• • Petersen graph

• • Complete bipartite graph

• • A cycle graph