The modular decomposition, augmented with quotients. At each node X, the set P of children of X are a partition of X, so they induce a quotient, G[X]/P in G[X]. The nodes of this quotient are P, so the quotient can be represented by installing its edges between the members of P. This is illustrated by the dashed lines connecting siblings. Two graph vertices are adjacent if and only if they are members of two siblings that are adjacent in their parent's quotient; the parent is their least common ancestor.

This work is ineligible for copyright and therefore in the public domain because it consists entirely of information that is common property and contains no original authorship.

This image could be re-created using vector graphics as an SVG file. This has several advantages; see Commons:Media for cleanup for more information. If an SVG form of this image is available, please upload it and afterwards replace this template with {{vector version available|new image name}}. It is recommended to name the SVG file “ModDecompQuotients.svg”—then the template Vector version available (or Vva) does not need the new image name parameter.