A SIMPLE GRAPH HAS NO LOOPS: A CONNECTION OF A NODE BACK TO ITSELF. IT CAN BE UNLABELED OR LABELED. AND IT CAN MODEL ANOTHER FIELD, SUCH AS SOCIAL RELATIONS.

---

STILL ONE POSSIBLE SIMPLE UNDERECTED DAFGRAFMODEL WITH A SINGLE NODE

           (isolated individual)  *

---

THE TWO POSSIBLE SIMPLE UNDIRECTED TRAFGRAFMODELS WITH TWO NODES (supposed to have solid segments) BECOME FOUR WITH SOCIALLY "DIRECTED" LABELING (ARROW REPRESENTS SOME SOCIAL RELATION: "FATHERING", "BEFRIENDING", "LOVING", "HATING", "EMPLOYING", ETC.)

                  *          *         *       *
                             ­         |       ­
                             |         ¯       ¯
                  *          *         *       *

---

WHAT DO THE FOUR POSSIBLE SIMPLE UNDIRECTED TRAFGRAFMODELS WITH THREE NODES BECOME WITH SOCIALLY DIRECTED LABELING?

     *           *           *
    / \           \ 
   /   \           \
  *-----*     *-----*     *     *

---

WHAT DO THE EIGHT POSSIBLE SIMPLE UNDIRECTED TRAFGRAFMODELS WITH FOUR NODES BECOME WITH SOCIALLY DIRECTED LABELS?

*     *       *     *       *     *       *-----*
                            |                   
                            |
*     *       *-----*       *-----*       *-----*


*   *       *---*       *---*       *---*
|\          |\          |\  |       |\ /|
| \         | \         | \ |       | \ |
|  \        |  \        |  \|       |/ \|
*---*       *---*       *---*       *---*

Etsettery? Dig?

Note: PECKING ORDERS, in associated files, appear in a graph form known as "The Hasse Diagram", named for the mathematician who introduced it. Although no showing it, the Hasse Diagram is a DIRECTED LABEL GRAPH, with JOINS DIRECTED UPWARDS, MEETS DIRECTED DOWNWARD.