On cyclic decompositions of the complete graph into the 2-regular graphs (Q2454980): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Cycle decompositions of \(K_n\) and \(K_n-I\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle decompositions III: Complete graphs and fixed length cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5771554 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5525915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence of cyclic \(k\)-cycle systems of the complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cyclic decomposition of complete graphs into almost-bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclically decomposing the complete graph into cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic Hamiltonian cycle systems of the complete graph. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclick-cycle systems of order 2kn +k: A solution of the last open cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Skolem-type difference sets for cycle systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak embedding of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal quadratic residue cyclic codes of length \(2^n\) / rank
 
Normal rank

Latest revision as of 10:30, 27 June 2024

scientific article
Language Label Description Also known as
English
On cyclic decompositions of the complete graph into the 2-regular graphs
scientific article

    Statements

    On cyclic decompositions of the complete graph into the 2-regular graphs (English)
    0 references
    22 October 2007
    0 references
    The symbol \(C(m_1^{n_1}m_2^{n_2}\dots m_s^{n_s})\) denotes a 2-regular graph consisting of \(n_i\) cycles of length \(m_i\), \(i=1,2,\dots ,s\). In this paper, we give some construction methods of cyclic \((K_v,G)\)-designs, and prove that there exists a cyclic \((K_v,G)\)-design when \(G=C((4m_1)^{n_1}(4m_2)^{n_2}\dots(4m_s)^{n_s})\) and \(v\equiv 1\) (mod\,\(2|G|\)).
    0 references
    0 references

    Identifiers