3-Factors of 3-Factorization of K3,3,3,…,3 with n-Partite Sets for All Even Integers n≥2

M.D.M.C.P. Weerarathna, D.M.T.B. Dissanayake and A.A.I. Perera
Additional contact information
M.D.M.C.P. Weerarathna: Department of Mathematics, Faculty of Science, University of Peradeniya, Sri Lanka
D.M.T.B. Dissanayake: Department of Mathematics, Faculty of Science, University of Peradeniya, Sri Lanka
A.A.I. Perera: Department of Mathematics, Faculty of Science, University of Peradeniya, Sri Lanka

International Journal of Research and Scientific Innovation, 2020, vol. 7, issue 1, 141-142

Abstract: A factorization of a graph G is a set of spanning sub-graph of G that are pairwise edge-disjoint and whose union is G. Factorization is one of the most active research areas in Graph Theory. In our previous work, 2-factors of 2-factorization of K(2,2,2,…,2) and K_(2r,2r,2r,⋯,2r) has been constructed by using degree factors. In this work, by considering degree factorization, a theorem has been proved to obtain 3-factors of 3-factorization of the complete multipartite graphs K(3,3,3,…,3).

Date: 2020
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.rsisinternational.org/journals/ijrsi/d ... -issue-1/141-142.pdf (application/pdf)
https://www.rsisinternational.org/virtual-library/ ... t&utm_campaign=First (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bjc:journl:v:7:y:2020:i:1:p:141-142

Access Statistics for this article

International Journal of Research and Scientific Innovation is currently edited by Dr. Renu Malsaria

More articles in International Journal of Research and Scientific Innovation from International Journal of Research and Scientific Innovation (IJRSI)
Bibliographic data for series maintained by Dr. Renu Malsaria ().