Topics: Graph Theory
(definition)
Let and be graphs.
We define the sum of both graphs, denoted , as the union of both graphs, with additional edges that connect all the vertices of to all the ones of .
Obligatory Connections
A new edge must be created between all of the vertices of and all the ones of , even if they were already connected in one of the graphs.