How does one "join" two graphs in graph theory?

9.8k Views Asked by At

I am asked to find the join of two graphs in graph theory. But I cannot find the exact definition! I know that in lattice theory, we join every vertex of a graph to every vertex of another graph to find the join of graphs. Any expert advice is welcome.

1

There are 1 best solutions below

2
On BEST ANSWER

The join of two graphs $G_1$ and $G_2$ , denoted by $G_1\nabla G_2 $, is a graph obtained from $G_1$ and $G_2$ by joining each vertex of $G_1$ to all vertices of $G_2$ . After joining the two graph the resultant graph will be of diameter at most 2.