Switching in one-factorisations of complete graphs (Q405262): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Changed an Item
Property / describes a project that uses
 
Property / describes a project that uses: nauty / rank
 
Normal rank

Revision as of 14:44, 28 February 2024

scientific article
Language Label Description Also known as
English
Switching in one-factorisations of complete graphs
scientific article

    Statements

    Switching in one-factorisations of complete graphs (English)
    0 references
    0 references
    0 references
    4 September 2014
    0 references
    Summary: We define two types of switchings between one-factorisations of complete graphs, called factor-switching and vertex-switching. For each switching operation and for each \(n\leq 12\), we build a switching graph that records the transformations between isomorphism classes of one-factorisations of \(K_{n}\). We establish various parameters of our switching graphs, including order, size, degree sequence, clique number and the radius of each component.{ }As well as computing data for \(n\leq12\), we demonstrate several properties that hold for one-factorisations of \(K_{n}\) for general \(n\). We show that such factorisations have a parity which is not changed by factor-switching, and this leads to disconnected switching graphs. We also characterise the isolated vertices that arise from an absence of switchings. For factor-switching the isolated vertices are perfect one-factorisations, while for vertex-switching the isolated vertices are closely related to atomic Latin squares.
    0 references
    one-factorisation
    0 references
    switching
    0 references
    perfect one-factorisation
    0 references
    Hamiltonian Latin square
    0 references
    atomic Latin square
    0 references
    group divisible design
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references