The partial complement of graphs (Q800383): Difference between revisions

For a graph G, the switched graph \(S_ v(G)\) of G at a vertex v is the graph obtained from G by deleting the edges of G incident with v and adding the edges of \(\bar G\) incident with v. Properties of graphs where \(S_ v(G)\cong G\) or \(S_ v(G)\cong\bar G\) are studied. This concept is extended to the partial complement \(S_ H(G)\) where \(H\subseteq V(G)\). The investigation here centers around the existence of sets H for which \(S_ H(G)\cong G\). A parameter is introduced which measures how near a graph is to being self-complementary.