A road network as shown in the figure connect four cites. In how many ways can you start from any city (say A) and come back to it without travelling on the same road more than once ?

There are five cities A, B, C, D, E on a certain island. Each city is connected to every other city by road. In how many ways can a person starting from city A come back to A after visiting some cities without visiting a city more than once and without taking the same road more than once ? (The order in which he visits the cities also matters. e.g., the routes A rarr B rarr C A and A rarr C rarr B rarr A are different).

There are five cities A, B, C, D, E on a certain island. Each city is connected to every other city by road. In how many ways can a person starting from city A come back to A after visiting some cities without visiting a city more than once and without taking same road more than once? (The order in which he visits the cities also matters: e.g. the routes A->B->C->A and A->C->B->A are different

How many numbers of 5 digits can be formed with the digits 0,2,5,6,7 without taking any of these digits more than once ?

How many numbers of 5 digits can be formed with the digits 0,2,5,6,7 without taking any of these digits more than once.

There are 6 roads between A & B and 4 roads between B & C. (i) In how many ways can one drive from A to C by way of B? (ii) In how many ways can one drive from A to C and back to A, passing through B on both trips? (iiiI In how many ways can one drive the circular trip described in (ii) without using the same road more than once?

How many numbers of 5 digits can be formed with the digit 0,2,5,6,7 without taking any of these digit more than once.

Ten buses are plying between two places A and B. In how many ways a person can travel from A to B and come back?

In how many ways can one or more fruits be selected from 4 apples ,5 oranges and 3 mangoes , if the fruits of the same kind be of the same shape ?