  Knopfmacher et all [1] was introduced the graph compositions` notion. In this
note we add to these a new construction of tree-like graphs where nodes are
graphs themselves. The first examples of these tree-like compositions, a
corresponding theorem and resulting conclusions are provided.
