Discrete Structures208110 marksEuler and Hamiltonian Path and Circuits
What are the necessary and sufficient conditions for graphs to have Euler path only and Euler circuit? Let R be a relation defined on set of natural numbers N, such that a,b in N, aRb leftrightarrow ab = 2k, where k in 0,1,2,.... Show that R is a partial ordering relation on N
What are the necessary and sufficient conditions for graphs to have Euler path only and Euler circuit? Let $R$ be a relation defined on set of natural numbers $N$, such that $a,b \in N, aRb \leftrightarrow ab = 2k$, where $k \in {0,1,2,...}$. Show that $R$ is a partial ordering relation on $N$ [10]
--- - Euler Path: A path in a graph that visits every edge exactly once (but may start and end at different vertices). - Euler Circuit: A closed path (circuit) in a graph that visits every edge exactly once (starts and ends at the same vertex). --- Theorem: A connected graph G has an Euler circui...