I have some isomorphic graphs (in fact, non-isomorphic graphs are also possible), and I want to glue them to a vertex. (Note that here this vertex is a cut vertex). Strictly speaking, two graphs $G_1$ with distinguished vertex $v_1$ and $G_2$ with distinguished vertex $v_2$, is formed by identifying vertices( gluing vertices) $v_1$ and $v_2$ that is, the vertices $v_1$ and $v_2$ are replaced by a single vertex $v$ adjacent to the same vertices in $G_1$ as $v_1$ and the same vertices in $G_2$ as $v_2$. If it is not necessary $v_1$ or $v_2$ may not be specified.
For example, as shown in the figure below, four $K_4$ are glued together on a vertex $u$. I am not sure if there is a function in mathematica that can do this quickly.
Sagemath seems to be relatively easy with built-in function merge_vertices.
g=graphs.CompleteGraph(4)
I = g.disjoint_union(g)
I = I.disjoint_union(g)
I.relabel()
I.plot()
I.merge_vertices([1,7,8])
I.relabel()
I.plot()
Of course, this problem can be extended, that is, two graphs can be glued together on a subgraph.
GraphDisjointUnion can get the disjoint union of several isomorphic graphs, but it is far from my requirement