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

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Traces / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3411976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On triple systems and strongly regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New families of atomic Latin squares and perfect 1-factorisations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory and application of latin bitrades: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of the Steiner triple systems of order 19 / rank
 
Normal rank
Property / cites work
 
Property / cites work: There are 526,915,620 nonisomorphic one‐factorizations of K<sub>12</sub> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5442531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4937802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating uniformly distributed random latin squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cycle switching graph of the Steiner triple systems of order 19 is connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations of<i>K</i><sub>14</sub> / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of 1-factorizations of the complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic Latin squares of order eleven / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3671211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical graph isomorphism. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-cycle free one-factorizations of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Switching codes and designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection of perfect 1-factorizations of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mappings of Latin squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: How<i>not</i>to prove the Alon-Tarsi conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4332941 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect factorisations of bipartite graphs and Latin squares without proper subrectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle switches in Latin squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic Latin squares based on cyclotomic orthomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetries that latin squares inherit from 1‐factorizations / rank
 
Normal rank

Latest revision as of 23:50, 8 July 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
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references