Connected Graphs - Let G be a connected graph in which for every edge there are cycles C1 and C2 both containing e while no other edge share by C1 and C2 . Prove that G is 3-edge-connected.
Truth Tables and Circuits - Construct a Truth Table for the circuit in the attachment. Prefer editable in word.
Connected Annulus - Prove the annulus A={z in (the set)R^2 : r <= |z| <= R} is connected.
Is it sufficient to show that the annulus is homomorphic to the circle, and then since circle is connected, so is the annulus ...