Scribd
Upload
4 views1 page

BCA Math Q4C

Uploaded by

artssatya51
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views1 page

BCA Math Q4C

Uploaded by

artssatya51
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Q4.

C)

Defini on of an Euler Graph:

An Euler graph is a connected graph in which every vertex has an even degree (the number of edges
incident to the vertex). An Euler walk is a walk that traverses every edge of the graph exactly once. A
connected graph has an Euler walk if and only if it has at most two ver ces of odd degree. If there
are exactly two ver ces of odd degree, the Euler walk must start at one of them and end at the
other. If all ver ces have even degree, the Euler walk is an Euler circuit, star ng and ending at the
same vertex.

Checking the given graph:

Let's determine the degree of each vertex in the provided graph:

 Vertex a: Degree 4 (edges to b, c, d, e)

 Vertex b: Degree 3 (edges to a, c, d)

 Vertex c: Degree 4 (edges to a, b, d, e)

 Vertex d: Degree 3 (edges to a, b, c)

 Vertex e: Degree 2 (edges to a, c)

 Vertex f: Degree 1 (edge to g)

 Vertex g: Degree 1 (edge to f)

We observe that ver ces b, d, f, and g have an odd degree.

Since the graph has more than two ver ces with an odd degree (it has four: b, d, f, and g), it is not an
Euler graph. Therefore, an Euler walk does not exist for this graph

You might also like