in Graph Theory
458 views
0 votes
0 votes
Is it necessary that euler graph should always be simple graph?
in Graph Theory
by
458 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.

1 comment

a connected graph which does not have more than 2 odd degree vertices either simple or multigraph is always have a euler path.
0
0
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

0 votes
0 votes
2 answers
4
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true