Graph theory and discrete mathematics

My examination is running. The examination name is B.Sc (Honours) part-3, 2020. Thought is exam should be held at tge end of 2020. But for Covid-19 pandemic, it is running now. Yesterday I have a exam on the subject, "Graph theory and discrete mathematics." This subject is the esiest for me among all courses of part-3. Alhamdulillah my exam has been well.

I want to tell about what we have to read for this course. First of all we have to read history of graph theory and discrete mathematics. Also the application of graph theory have to be read. We have read different types of graph. Here we have to solve some puzzle. Such as, Konigsberg bridge problem puzzle, Hamiltonian puzzle basically for dodecahedron and polyhedron. Konigsberg bridge problem was an old puzzle to find out a path over one of every seven bridge that span a forked river flowing past an island without crossing any bridge twice. I like to read Euler solution for Konigsberg bridge problem puzzle and Hamiltonian puzzle. Though it is very hard to characterize Hamiltonian trail than the Euler trail. Moreover, we have to solve travelling salesman problem, round robin tournament problem etc.

We must read about different types of trees in this course. The most important trees are binary tree, binary search tree, binary 2-tree, spanning tree, weighted spaning tree ( It is used to solve travelling salesman problem), Huffman algorithm and Huffman code.

We have to read about matrix representation of different types of graph, advanced vector space, modelling the graph in real life.

Anyway for this course I follow the book name, "Introduction of Discrete Mathematics." wtitten by Robert J McElice. It is an very helpful book for this regard. Thanks everyone for stopping by.

I will upvote everyone who will interact with me.