SavedAdd your journal

Journals / Anadolu Üniversitesi Bilim ve Teknoloji Dergisi :A-Uygulamalı Bilimler ve Mühendislik / 2002 / Cilt: 3 - Sayı: 3

Tam grafların özel parçalanışlarındaki döngüler

Cyles in 2-factorizations of $K_n$

Selda KÜÇÜKÇİFÇİ
Pages
413–419
Publication Date
2022-10-11
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

This work studies cycles in 2-factorizations of $K_n$ (undirected complete graph with n vertices) and gives a complete solution (with three possible exceptions) of the problem of constructing 2-factorizations of $K_n$ containing a specified number of 8-cycles, for both n even and odd.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:This work studies cycles in 2-factorizations of $K_n$ (undirected complete graph with n vertices) and gives a complete solution (with three possible exceptions) of the problem of constructing 2-factorizations of $K_n$ containing a specified number of 8-cycles, for both n even and odd.
📊
Key Findings & Data:This work studies cycles in 2-factorizations of $K_n$ (undirected complete graph with n vertices) and gives a complete solution (with three possible exceptions) of the problem of constructing 2-factorizations of $K_n$ containing a specified number of 8-cycles, for both n even and odd.
💡
Conclusion & Impact:This work studies cycles in 2-factorizations of $K_n$ (undirected complete graph with n vertices) and gives a complete solution (with three possible exceptions) of the problem of constructing 2-factorizations of $K_n$ containing a specified number of 8-cycles, for both n even and odd.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

This work studies cycles in 2-factorizations of $K_n$ (undirected complete graph with n vertices) and gives a complete solution (with three possible exceptions) of the problem of constructing 2-factorizations of $K_n$ containing a specified number of 8-cycles, for both n even and odd.

Özet

Bu çalışmada n köşeli tam graflardaki döngüler problemi işlenmekte, tek ve çift köşeli tam graflardaki 8-döngü sayısı problemine (üç olası istisna ile) çözüm verilmektedir.

🔖

Cite This Article

KÜÇÜKÇİFÇİ, S. (2022). Tam grafların özel parçalanışlarındaki döngüler. Anadolu Üniversitesi Bilim ve Teknoloji Dergisi :A-Uygulamalı Bilimler ve Mühendislik, Cilt: 3 - Sayı: 3, 413–419. https://ajindex.com/articles/438484

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (8)

  1. P. Adams, E. J. Billington, I. J. Dejter, and C. C. Lindner (2000). The number of 4-cycles in 2- factorizations of $K_{2n}$ minus a 1-factor, Discrete Mathematics 220(1-3), 1-11.
  2. P. Adams, E. J. Billington, C. C. Lindner (2002).The number of 6-cycles in 2-factorizations of $K_n$, n odd.JCMCC 41, 223-243.
  3. I. J. Dejter, F. Franek, E. Mendelsohn, and A. Rosa (1997). Triangles in 2-factorizations, J. Graph Theory 26, 83-94.
  4. I. J. Dejter, C. C. Lindner, and A. Rosa (1998). The number of 4-cycles in 2-factorizations of $K_n$,JCMCC 28, 101-112.
  5. S. Küçükçifçi (2000). The number of 8-cycles in 2- factorizations of $K_n$, Australasian Journal of Combinatorics 22, 201-218.
  6. S. Küçükçifçi (2002). The number of 8-cycles in 2- factorizations of $K_n$ minus a 1-factor, Utilitas Mathematica 61, 225-237.
  7. C. C. Lindner and C. A. Rodger (1997).
  8. Design Theory, CRC Press, Boca Raton. E. Lucas (1883). Recreations mathematiques, Gauthier- Villars, Paris. D. K. Ray-Chaudhuri and R. M. Wilson (1971). Solution of Kirkman's school-girl problem, in: Combinatorics, Proc. Sympos. Pure Math. 19, AMS,187-203.