Rooted product of graphs

Binary operation performed on graphs

In mathematical graph theory, the rooted product of a graph G and a rooted graph H is defined as follows: take |V(G)| copies of H, and for every vertex vi of G, identify vi with the root node of the i-th copy of H.

This keyword could refer to multiple things. Here are some suggestions: