Figure 2 - uploaded by David Forster
Content may be subject to copyright.
A connected graph with vertices A to D and edges 1 to 5 is shown on the left. A bipartite graph with the two vertex sets S 1 and S 2 is shown on the right, indicating the partitioning of the vertices.

A connected graph with vertices A to D and edges 1 to 5 is shown on the left. A bipartite graph with the two vertex sets S 1 and S 2 is shown on the right, indicating the partitioning of the vertices.

Source publication
Conference Paper
Full-text available
Structural engineers often want to have a redundant structure where the loss of a member would not lead to structural collapse. For a truss, adding a bar beyond that required for static determinacy renders the structure redundant, but what is the spatial distribution of the static indeterminacy within the individual elements of a framework? Can an...

Contexts in source publication

Context 1
... a detailed and extensive introduction to this field, we refer to the textbooks of Graver [10] and Wilson [19]. In order to apply graph theory in the context of structural assessment, some necessary Figure 2 shows on the left a graph with four vertices (A to D) and five edges (1 to 5). It is a connected graph, since no partition of the vertices into two nonempty sets exists. ...
Context 2
... means that each edge E has an endpoint in S 1 and an endpoint in S 2 . Such an exemplary bipartite graph is shown in Figure 2 on the right. ...