Self-dual embeddings of complete bipartite graphs (Q1193565): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The construction and classification of self-dual spherical polyhedra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Self-dual orientable embedding of \(K_n\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Self-dual embeddings of Cayley graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Orientable imbeddings of Cayley graphs / rank | |||
Normal rank |
Latest revision as of 14:18, 16 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Self-dual embeddings of complete bipartite graphs |
scientific article |
Statements
Self-dual embeddings of complete bipartite graphs (English)
0 references
27 September 1992
0 references
It is shown that, in both the orientable and the nonorientable sense, \(K_{n,m}\) has a self-dual imbedding if and only if \(n\) and \(m\) are both even integers exceeding 2, except that \(K_{6,6}\) has no orientable self-dual imbedding. The latter claim was verified by an exhaustive computer search. The requisite constructions for the other cases use a ``cut and paste'' procedure to join two self-dual imbeddings into one larger self-dual imbedding.
0 references
self-dual embeddings
0 references
complete bipartite graphs
0 references