links

https://ranger.uta.edu/~tiernan/CSE2315/ads.pdf

https://discrete.openmathbooks.org/dmoi3/dmoi.html

Unit 7: Graph Theory Assignment 1 Show written solutions for all of the following problems. Text: Discrete Mathematics: An Open Introduction, 3d Edition. 4.1 Definitions, Exercises: 5, 6, 7, 8 4.3 Planar Graphs, Exercises: 3, 4, 11, 13 4.5 Euler Paths and Circuits, Exercises: 3, 4, 5, 6, 11, 12 Text: Applied Discrete Structures 9.1: Graphs - General Introduction, Exercise: 9.1.4, 9.1.6 9.3: Connectivity, Exercise: 9.3.2, 9.3.4 (trace through Algorithm 9.3.8. Breadth-first Search) 9.5: Graph Optimization, Exercise Use Algorithm 9.5.5 The Closest Neighbor Algorithm to find the closest neighbor circuit and cost starting at vertex 1 in Figure 1. 5 2 7 11 3 5 2 Figure 1Exercise Isomorphism Determine which among the four graphs pictured in Figure 2 are isomorphic. For each pair of isomorphic graphs, describe an isomorphism between them. For each pair of graphs that are not isomorphic, give a property that is preserved under isomorphism such that one graph has the property, but the other does not. For at least one of the properties you choose, prove that it is indeed preserved under isomorphism [you onlyr need prove one ofthem}. [(363 Figure 2