fiLl in the Blanks $K _ { n }$ Has ____ 1's and ____ 0's

Q11: Are these two graphs isomorphic? <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB6843/.jpg"

Q12: Give a recurrence relation for e_n

Q13: fill in the blanks.<br>-The largest value

Q14: fill in the blanks.<br>-List all positive

Q15: fill in the blanks.<br>-List all positive

Q17: Use Dijkstra's Algorithm to find the shortest

Q18: Find the strongly connected components of the

Q19: In K_3,3 let a and b be

Q20: Find the edge chromatic number for each

Q21: Suppose you have a graph G