граф теори 3 курс

Is this graph connected?

• yes

• no

How many connected components does this graph have?

• 8

• 1

• 3

• 2

Is there a path from v1 to v6​?

• yes

• no

What is the distance (the weight of the shortest path) from v1​ to v6​?

• 11

• 8

• 9

• 7

Are these graphs complement?

• yes

• no

Is this a complete graph?

• yes

• no

Is this a tree?

• no

• yes

This graph is

• a cycle

• a tree

• complete

• bipartite

This graph is

• a path

• a cycle

• a tree

• bipartite

Select graphs that have an Eulerian cycle.

• Graph1

• Graph2

• Graph3

• Graph4