Graphs self-complementary in \(K_ n-e\) (Q1813737): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Thomas Andreae / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Thomas Andreae / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A graph and its complement with specified properties V: The self‐complement index / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The partial complement of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Selbstkomplementäre Graphen / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5730676 / rank | |||
Normal rank | |||
Latest revision as of 17:07, 14 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graphs self-complementary in \(K_ n-e\) |
scientific article |
Statements
Graphs self-complementary in \(K_ n-e\) (English)
0 references
25 June 1992
0 references
A graph \(G\) with \(n\) vertices is called self-complementary (s.c.) in \(K_ n-e\) if \(K_ n-e\) is the edge-disjoint union of two subgraphs \(G_ 1\), \(G_ 2\) isomorphic to \(G\), and a corresponding permutation of \(V(G)\) induced by an isomorphism from \(G_ 1\) to \(G_ 2\) is called a complementing permutation. The structure of complementing permutations is analyzed and the diameter of graphs which are s.c. in \(K_ n-e\) is determined.
0 references
self-complementary
0 references
complementing permutation
0 references
