Graph Theory Quiz

The Konigsberg bridge problem has ____ bridges

• 5

• 6

• 7

• 8

In a graph G=(V,E), V is called ______

• edge set

• vertex set

• Vowel

• None of these

A graph is said to be finite if it has ______ number of vertices and ______ number of edges.

Evaluate responses using AI:

OFF

If an edge is associated with a vertex pair (vi,vi), then it is called a ______.

Evaluate responses using AI:

OFF

If two or more edges are associated with same vertex pair, then such edges are called __________.

Evaluate responses using AI:

OFF

A graph which has neither a self-loop nor parallel edges is called a _____________.

Evaluate responses using AI:

OFF

Define the terms 'vertex' and 'edge' in graph theory.

• A vertex is a line in a graph, and an edge is a point connecting two lines.

• A vertex is a color in a graph, and an edge is a shape connecting two colors.

• A vertex is a number in a graph, and an edge is a curve connecting two numbers.

• A vertex is a point in a graph, and an edge is a line connecting two vertices.

What characteristics define an Euler graph?

• An Euler graph has all vertices of even degree and is connected.

• An Euler graph can have multiple disconnected components with even degrees.

• An Euler graph has at least one vertex of odd degree and is connected.

• An Euler graph has all vertices of odd degree and is disconnected.

How can you determine if a graph is Hamiltonian?

• A graph is Hamiltonian if it has at least one edge.

• A graph is Hamiltonian if there exists a cycle that visits each vertex exactly once.

• A graph is Hamiltonian if it has an even number of vertices.

• A graph is Hamiltonian if it contains a complete subgraph.

Construct a simple graph with 4 vertices and 5 edges.

• Vertices: A, B, C, D; Edges: A-B, A-C, B-C, C-D

• Vertices: A, B, C, D; Edges: A-B, A-C, A-D, B-C

• Vertices: A, B, C; Edges: A-B, A-C, B-C

• Vertices: A, B, C, D; Edges: A-B, A-C, A-D, B-C, B-D