Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In mathematics and computer science, connectivity is one of the basic concepts of graph theory. It is closely related to the theory of network flow problems. The connectivity of a graph is an important measure of its robustness as a network.In an undirected graph G, two vertices u and v are called connected if G contains a path from u to v. Otherwise, they are called disconnected. If the two vertices are additionally connected by a path of length 1, i.e. by a single edge, the vertices are called adjacent. A graph is said to be connected if every pair of vertices in the graph are connected.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.