a.
An edge in an undirected connected graph is a bridge if removing it disconnects the graph. Prove that every connected graph all of whose vertices have even degrees contains no bridges.
b.Let r,s,u be binary relations in U. Verify the following property: if both relations r and s are transitive then the intersection of r and s is transitive too.
Get Answers For Free
Most questions answered within 1 hours.