Intro to P-sum, Extended P-sum, and NEPS of Graphs [Graph Theory]

This video covers the graph operations known as p-sum, extended p-sum, and NEPS (non-extended p-sum). Each of these operations takes an ordered n-tuple of graphs as input, and outputs a graph with vertex set equal to the cartesian product of the input graph's vertex sets. However, these operations differ in how their edge sets are defined. The NEPS is the most general of these operations and contains the other two as special cases. The p-sum is the least general of these operations and is a special case of both the NEPS and the extended p-sum. These operations can be used to represent certain graph products (cartesian, tensor, strong products), but are more general than graph products as well.

Links for more information:
https://www.jstor.org/stable/43667432