Skip to main content
Figure 1 | BioData Mining

Figure 1

From: Using graph theory to analyze biological networks

Figure 1

Undirected, Directed, Weighted, Bipartite graphs. A. Undirected Graph: V = {V 1 , V 2 , V 3 , V 4 }, |V| = 4, E = {(V 1 , V 2 ), (V 2 , V 3 ), (V 2 , V 4 ), (V 4 , V 1 )}, |E| = 4. B. Directed Graph: V = {V 1 , V 2 , V 3 , V 4 }, |V| = 4, E = {(V 1 , V 2 ), (V 2 , V 3 ), (V 2 , V 4 ), (V 4 , V 1 ), (V 4 , V 2 )}, |E| = 5. C. Weighted Graph: V = {V 1 , V 2 , V 3 , V 4 }, |V| = 4, E = {(V 1 , V 2 , V 4 ), (V 2 , V 3 , V 2 ), (V 2 , V 4 , V 9 ), (V 4 , V 1 , V 8 ), (V 4 , V 2 , V 6 )}, |E| = 5. D. Bipartite graph: V = {U 1 , U 2 , U 3 , U 4 , V 1 , V 2 , V 3 }, |V| = 7, E = {(U 1 , V 1 ), (U 2 , V 1 ), (U 2 , V 2 ), (U 2 , V 3 ), (U 3 , V 2 ), (U 4 , V 2 )}, |E| = 6.

Back to article page