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] Neal Caffery asked Dec 11, 2016 reshown Dec 12, 2016 by Neal Caffery Neal Caffery 223 views answer comment Share Follow See 1 comment See all 1 1 comment reply Aghori commented Dec 13, 2016 reply Follow Share I think minimum number is when graph is cycle. Therefore 15!. Isn't it? 0 votes 0 votes Please log in or register to add a comment.