State necessary and sufficient conditions for a graph to… – BIT Discrete Structure 2079 Solved

BIT Discrete Structure · 2079 · Solved Question with Answer

State necessary and sufficient conditions for a graph to have Euler path and circuit. Find the GCD of 12 and 18 using Extended Euclidian Algorithm.

Solution

State necessary and sufficient conditions for a graph to have Euler path and circuit. Find the GCD of 12 and 18 using Extended Euclidian Algorithm.