For each True/False question, enter only T or F because it will be auto-graded and expects one of these answers only. (a) It is not possible to make a graph with degree sequence 3,3,1,1,1,1. (b) A...

#10 True or false?

Extracted text: For each True/False question, enter only T or F because it will be auto-graded and expects one of these answers only. (a) It is not possible to make a graph with degree sequence 3,3,1,1,1,1. (b) A proof by mathematical induction must begin with proving the equation or inequality true for n=1. (c) A Eulerian circuit must use every edge of the graph. (d) A Hamiltonian cycle cannot contain a cycle, except for itself. (e) A bipartite graph cannot contain any cycle.