A note on Frucht diagrams, Boolean graphs and Hamilton cycles (Q685668): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3936766 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3691702 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Two Hamilton cycles in bipartite reflective Kneser graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3412746 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: HOW TO DESCRIBE A GRAPH / rank | |||
Normal rank |
Latest revision as of 10:55, 22 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on Frucht diagrams, Boolean graphs and Hamilton cycles |
scientific article |
Statements
A note on Frucht diagrams, Boolean graphs and Hamilton cycles (English)
0 references
24 October 1993
0 references
For integers \(0<i<j\) let \(V_ i\) and \(V_ j\) denote the sets of all \(i\)-element respectively \(j\)-element subsets of \(\{1,2, \dots,i+j\}\). The bipartite graph \(RG_{ij}\) has vertex set \(V_ i \cup V_ j\), and \(X \in V_ i\) and \(Y \in V_ j\) are adjacent if \(X \subseteq Y\). I. Hável conjectured that every such graph \(RG_{ij}\) is Hamiltonian. In this note the authors demonstrate the method of constructing Hamiltonian cycles in \(RG_{ij}\) by means of group actions on graphs, and apply it to the graph \(RG_{5,6}\).
0 references
Frucht diagrams
0 references
Boolean graphs
0 references
bipartite graph
0 references
Hamiltonian cycles
0 references
group actions
0 references