Graph Theory-2024

There are ____ bridges in the Königsberg bridge problem.

______________________ the father of graph theory.

The Königsberg bridge problem has ______ solution.

A graph is said to be finite, if it has finte number of _______ and finite number of ________; otherwise graph is said to be

Every edge is incident on _____ vertices and they are the ______ vertices of the edge

In _____, Euler wrote the first paper in graph theory.

• 1735

• 1736

• 1935

• 1936

A graph is said to be

finite if it has a finite number of _____ and a finite number of ______

If two or more edges are associated

with same vertex pair, then such edges are called _______ edges.

A graph which has neither a self loop

nor parallel edges is called a ______ graph.