Non-complete Extended P-sum of Graphs, Graph Angles and Star Partitions


Dragoš Cvetković, Slobodan Simić


The NEPS (Non-complete Extended $P$-Sum) of graphs is a graph operation in which the vertex set of the resulting graph is the Cartesian product of the vertex sets of starting graphs. The paper contains a survey on NEPS and some new results concerning graph angles and star partitions of NEPS.