MAD 3305 Midterm: MAD 3305 FIU Exam 2k
Document Summary
The exam should take about one hour, to be followed by a lecture. Most problems are 10 points each, unless labeled. [the graph was k4 drawn twice, plus one more edge to connect them]. Give an example (draw it) of a graph g with exactly 16 53 non-identical spanning trees. Prove that the n-cube qn is hamiltonian, for n 2. Give an example of a kn,m with n, m 3 that is neither hamiltonian nor eulerian, and justify your answer: (20pts total) answer each with true or false: An arc e of a network is saturated if f (e) = c(e). If g has adjacency matrix a and degree matrix d then all the co-factors of d a are equal. In every planar graph, q 3p 6. A hu man tree for a list of n frequencies has the minimum height among all full binary trees with n leaves.
