2 problems

Let $G$ be a self-complementary symmetric graph of order $n$, let $\overline{G}$ denote its complement, and let $G^{-1}$ denote its inverse under the graph operation used in the pa…

Let $G$ be a self-complementary graph, meaning that $G$ is isomorphic to its complement. A partition $\mathcal{P}=\{V_{1},V_{2},V_{3},V_{4}\}$ of $V(G)$ is a rectangle partition if…