The partial complement of graphs (Q800383): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
Property / author | |||
Property / author: Gary Chartrand / rank | |||
Property / author | |||
Property / author: Don R. Lick / rank | |||
Property / author | |||
Property / author: Seymour Schuster / rank | |||
Revision as of 14:26, 11 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The partial complement of graphs |
scientific article |
Statements
The partial complement of graphs (English)
0 references
1985
0 references
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.
0 references
switched graph
0 references
partial complement
0 references
self-complementary
0 references