475 views

2 Answers

0 votes
0 votes
No. Not Necessary. Euler Graph simply means a Graph with Euler Path/Circuit in it (Cover Every Edge Exactly Once). So, You can take a Undirected Graph with Two vertices and Two edges between them. It would be a Euler Graph But Yet Not Simple Graph.
0 votes
0 votes
A closed walk containing every edge of a multigraph is called Eular circuit. And a multigraph containg eular circuit is called eular graph.

So graph should be simple not necessary.

Related questions

361
views
1 answers
0 votes
Anand67222 asked Oct 14, 2023
361 views
How many simple directed (unweighted) graphs on the set of vertices {v0,v1,…v5} are there that have at most one edge between any pair of vertices? (That is, for two ver...
220
views
1 answers
0 votes
gagan55 asked Jun 30, 2023
220 views
Number of hamiltonian cycles for a graph K 5, 5( bipartite graph ) ??
1.2k
views
1 answers
0 votes
Abhrajyoti00 asked Jul 21, 2022
1,187 views
How to determine for which m, n the complete bipartite graph $Km,n$ is planar?I am getting two answers from two sources:-A complete bipartite graph $Kmn$ is planar if and...
271
views
2 answers
0 votes