reshown by
222 views
0 votes
0 votes
Suppose a connected graph has 15 labeled nodes, given that it has an eularian circuit, what is the minimum number of distinct circuits which it must have? [Note : the circuit a->b->c->a is not same as b->c->a->b]
reshown by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
Neal Caffery asked Dec 12, 2016
505 views
Suppose a connected graph has 15 labeled nodes, given that it has an eularian circuit, what is the minimum number of distinct circuits which it must have? [Note : the cir...
0 votes
0 votes
0 answers
2
Lakshman Bhaiya asked Oct 21, 2018
1,547 views
How many Eulerian graphs are possible?