Graphs are essential for modeling networks, data structures, and computer algorithms. Balakrishnan covers: Basic definitions: paths, circuits, and trees. Planar graphs and graph coloring. Eulerian and Hamiltonian circuits. 4. Algebraic Structures Groups, rings, and fields. Modular arithmetic (essential for cryptography). Boolean algebras as applied to circuit design.
You can borrow a digital copy for free through the Internet Archive , which hosts a scan of the 1996 Dover edition.
This is the heart of discrete mathematics for many computer science students. The PDF versions of this text are often bookmarked heavily at this chapter.
