Skip to main content
Fig. 3 | BMC Bioinformatics

Fig. 3

From: ppiGReMLIN: a graph mining based detection of conserved structural arrangements in protein-protein interfaces

Fig. 3

Induced subgraphs and linegraphs. Graphs on the left represent a graph G and a set of induced subgraphs G′,G′′,G′′′ of G. Red dashed edges in G′ and G′′ are the edges missing in each graph for them to become vertex-induced subgraphs of G. G′′′ is the only vertex-induced subgraph of G, as its contains all edges of its supergraph between its nodes. The linegraphs of each graph are represented on the right. Edges in a lighter color represent missing edges in L(G′),L(G′′) and L(G′′′), relative to the linegraph L(G). Although the original graphs are not all vertex-induced subgraphs, their line graphs are

Back to article page