For computer science students, the chapters on graph theory (trees, Eulerian paths, Hamiltonian cycles) and combinatorics are worth the price alone. The book connects abstract concepts directly to algorithm design without getting lost in jargon.
Since Balakrishnan is terse, supplement with free video lectures: introductory discrete mathematics balakrishnan pdf
V.K. Balakrishnan is a respected mathematician and professor. Unlike massive, encyclopedic textbooks (which can be 1,000+ pages), Balakrishnan’s "Introductory Discrete Mathematics" is concise, precise, and direct. For computer science students, the chapters on graph