Angielski
The book covers all the basics of both the topics. The topics are sequenced in such a manner that there is a flow in understanding the advances. The first and second chapters cover all the basic methods and tools for counting. Chapter 3 is on binomial theorem and binomial identities. Topics such as partitions, permutations on multisets, generating functions, recurrence relation, principle of inclusion exclusion, repeated counting, partially ordered sets and Mobius inversion, Polya's counting are covered in different chapters. Some basic chapters have some worked-out exercise. Information on Catalan numbers, Eulerian Numbers, Narayana Numbers, and Schroder Number are given in a chapter. The topic on "discrete probability" covers the connection between counting techniques and probability theory.
There second part of the book covers topics in graph theory such as basics of graphs, trees,bipartite graphs, matching , planar graphs, Euler and Hamilton graphs, graph coloring, Ramsey theory, spectral properties, and some graph algorithms.Adequate exercise and examples are provided so as to enhance the reader's interest and understanding. Some interesting concepts like high hamiltonicity, power of graphs, domination, and matrix tree theorem are introduced.
