0 0 votes How many Eulerian graphs are possible? Graph Theory engineering-mathematics discrete-mathematics graph-theory + – Lakshman Bhaiya 2.9k views answer comment Share Follow Print See all 18 Comments 18 18 Comments reply Shubhanshu commented Oct 21, 2018 reply Follow flag Above graph is Euler graph and the following graph are subgraph of above graph and are Euler graphs 1. 012 2. 134 3. 234 0 0 replyShare Lakshman Bhaiya commented Oct 21, 2018 reply Follow flag and how many Eulerian circuits are possible? 0 0 replyShare Utkarsh Joshi commented Oct 21, 2018 reply Follow flag Lakshman Patel RJIT What exactly they are asking in question? 0 0 replyShare Shubhanshu commented Oct 21, 2018 reply Follow flag 3 Eulerian circuits are there. 0 0 replyShare Lakshman Bhaiya commented Oct 21, 2018 reply Follow flag @Utkarsh Joshi they want to find the number of Eulerian circuits I'm able to find the Eulerian circuit$:0,1,3,4,1,2,3,5,4,2,0$ 0 0 replyShare Shubhanshu commented Oct 21, 2018 reply Follow flag And what is the given answer. 0 0 replyShare Lakshman Bhaiya commented Oct 21, 2018 reply Follow flag They just give only one Eulerian circuit, but i want to find total how many possible? $1,3,4,1,2,3,5,4,2,0,1$ there is any formula?? 0 0 replyShare Lakshman Bhaiya commented Oct 21, 2018 reply Follow flag $0,1,2,3,4,1,3,5,4,2,1,0$ are also the Eulerian circuit? 0 0 replyShare Utkarsh Joshi commented Oct 21, 2018 reply Follow flag yes! 0 0 replyShare Lakshman Bhaiya commented Oct 21, 2018 reply Follow flag How to find all Eulerian circuits? 0 0 replyShare Lakshman Bhaiya commented Oct 21, 2018 reply Follow flag Counting Eulerian circuits is a P-complete problem? 0 0 replyShare Lakshman Bhaiya commented Oct 21, 2018 reply Follow flag How many different Eulerian circuits we could find? 0 0 replyShare Utkarsh Joshi commented Oct 21, 2018 reply Follow flag I don't see any option other than brute force! 0 0 replyShare Lakshman Bhaiya commented Oct 21, 2018 reply Follow flag can you share the solution? 0 0 replyShare Utkarsh Joshi commented Oct 21, 2018 reply Follow flag Nope! there will be many Euler circuits, right? each starting with a new vertex! What's the answer for this question? 0 0 replyShare Lakshman Bhaiya commented Oct 21, 2018 reply Follow flag For undirected graph(above comment) answer is $80$ and for the directed graph(main question) I don't know 0 0 replyShare Gurdeep Saini commented Nov 15, 2018 reply Follow flag for undirected gragh what is formula @lakshman For undirected graph(above comment) answer is 80 0 0 replyShare Gyanu commented Jun 21, 2019 reply Follow flag @Lakshman Patel RJIT I got only 4 Eulerian circuits by brute force method:- 01342354120 01354234120 01235413420 01234135420 Any other Eulerian circuits? 0 0 replyShare Please log in or register to add a comment.
