Figure 2 - Structural Analysis Using the Redundancy Matrix and Graph Theory

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.

Go to figure page

Reference

Structural Analysis Using the Redundancy Matrix and Graph Theory - Scientific Figure on ResearchGate. Available from: https://www.researchgate.net/figure/A-connected-graph-with-vertices-A-to-D-and-edges-1-to-5-is-shown-on-the-left-A-bipartite_fig2_383562923 [accessed 24 Jun 2025]

Caption

Figure 2: 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.

Embed code

<a href="https://www.researchgate.net/figure/A-connected-graph-with-vertices-A-to-D-and-edges-1-to-5-is-shown-on-the-left-A-bipartite_fig2_383562923"><img src="https://www.researchgate.net/profile/David-Forster-3/publication/383562923/figure/fig2/AS:11431281274742277@1725039711766/A-connected-graph-with-vertices-A-to-D-and-edges-1-to-5-is-shown-on-the-left-A-bipartite.png" alt="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>