Graphs self-complementary in \(K_ n-e\) (Q1813737)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4912
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graphs self-complementary in \(K_ n-e\) |
scientific article; zbMATH DE number 4912 |
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
0.832771897315979
0 references
0.8168703317642212
0 references
