No Access
Chapter 21: Graphs and Matrices
https://doi.org/10.1142/9789813143807_0021Cited by:0 (Source: Crossref)
Abstract:
A graph consists of a non-empty set of points, called vertices (singular: vertex) or nodes, and a set of lines or curves, called edges, such that every edge is attached at each end to a vertex. We assume that V = { 1, 2, … , n }. A digraph (directed graph) is a diagram consisting of points, called vertices, joined by directed lines, called arcs. Thus each arc joins two vertices in a specified direction. To distinguish them from undirected graphs the edges of a digraph are called arcs…
