Figure 3From: Clustering under the line graph transformation: application to reaction network(A) Graph G with two hubs with degree k' and k" connected by edge a. (B) The corresponding line graph L(G) after the line graph transformation is done. (C) Graph G where edges b and b' have a common node as endpoint. (D) Line graph of (C). It is worth noticing that (D) has only one more edge than (B). Hence, (D) has one more triangle that go through node a than (B).Back to article page