Discrete Structure207910 marksNumerical: Euler graph and GCDEuler paths and circuits
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.[4+6]
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.[4+6]
- Numbers for GCD computation: $a = 12$, $b = 18$ - Required: necessary and sufficient conditions for Euler path and Euler circuit; GCD via Extended Euclidean Algorithm expressing $\gcd$ as a linear combination. No data missing. --- - Euler Path: A trail that uses every edge of the graph exactly ...