Vendor: —
Price: 1474.00 RUB
This essential textbook offers a structured introduction to graph theory, perfect for students tackling discrete mathematics. The guide begins with foundational definitions and concepts, then walks readers through constructing adjacency and incidence matrices for both undirected and directed graphs. You will learn core operations on graphs, including intersection, union, symmetric difference, and the removal of vertices or edges.
The book clearly explains different types of routes within graphs: chains, paths, composite and simple variations, as well as cycles and contours. Practical methods are provided for identifying a route of a given length and finding the shortest path in a directed graph. Additionally, the text covers how to build reachability and counter-reachability matrices.
To reinforce learning, the manual includes 30 different individual assignment options for independent study. While primarily designed for students in all specialties studying discrete mathematics, it also serves as a useful resource for graduate students in construction fields learning about network planning. This is a reliable, fact-based academic resource with no speculative content.