Given a finite simple graph on n vertices, its complementary prism is a graph on 2n vertices, which is obtained from the disjoint union of the graph and its complement, if we add n edges that join identical vertices in the graph and in its complement. Complementary prisms generalize the Petersen graph. In the talk I will describe few properties of these graphs.

Everyone is welcome and encouraged to attend.