1) Is the graph in Fig.1 a) a connected graph? b) a complete graph? c) a tree? d) a weighted graph? e) a digraph?

Recall the complete bipartite graph Km.n. a) Draw K5,3. b) Determine the number of vertices in Km.n. c) Determine the number of edges in Km,n. d) The complement of a graph G is the graph G with same vertex set; but complement edge set. Draw K4,3. e) What kind of graph isKm.n.

3. The in-degree and the out-degree of the vertex d in the following graph are: A) 5 & 1 B) 5 & 2 C) 5 & 3 D) 6 & 2

uits HW.pdf er Circuits HW.pdf GT-Euler Circuits HW.pdf (2.89 MB) | A Alternative formats. Page of 4 B O A E

Question 4. Let K, be the complete graph on n vertices. How many edges does it have? Justify your answer.

Draw these graphs. a)       K1,4 b)       W4

a. the number of edges in the graph, b. the number of vertices in the graph, c. the number of vertices that are of odd degree, d. whether the graph is connected, and e. whether the graph is a complete graph. 5.

2) Determine which of the graphs, if any, is/are connected. There can be more than one answer here. Either circle the letter(s) of the connected graph(s) or list the letters on the line given. If there are no connected graphs here, state NONE on the line provided. B d d 1 2)

1) Definitions. The graph below shows 5 cities. The weights on the edges represent the airfare for a one-way flight between the cities. a. How many vertices and edges does the graph have? b. Is the graph connected? c. What is the degree of the vertex representing LA? d. If you fly from Seattle to Dallas to Atlanta, is that a path or a circuit? And what is its cost? e. If you fly from LA to Chicago to Dallas to LA, is that a path or a circuit? And what is its cost? f. Is the graph a complete graph? If so, how many Hamiltonian circuits does it have? Seattle LA $100 $70 $150- $145 Chicago $170 $75 $120 $140 $165 $85 Atlanta Dallas