Factorizations of the product of cycles
An -factorization of a graph is a partition of the edge set of into spanning subgraphs (or factors) each of whose components are isomorphic to a graph Let be the Cartesian product of the cycles with for each El-Zanati and Eynden proved that has a -factorization, where is a cycle of length if and onl...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2019-12-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2018.06.003 |
| id |
doaj-e9c78ae1ff6242f98707d5b8df373008 |
|---|---|
| record_format |
Article |
| spelling |
doaj-e9c78ae1ff6242f98707d5b8df3730082020-11-25T02:06:53ZengTaylor & Francis GroupAKCE International Journal of Graphs and Combinatorics0972-86002019-12-0116332433110.1016/j.akcej.2018.06.00312092699Factorizations of the product of cyclesY.M. Borse0A.V. Sonawane1S.R. Shaikh2Department of Mathematics, Savitribai Phule Pune UniversityDepartment of Mathematics, Savitribai Phule Pune UniversityDepartment of Mathematics, Savitribai Phule Pune UniversityAn -factorization of a graph is a partition of the edge set of into spanning subgraphs (or factors) each of whose components are isomorphic to a graph Let be the Cartesian product of the cycles with for each El-Zanati and Eynden proved that has a -factorization, where is a cycle of length if and only if with We extend this result to get factorizations of into -regular, -connected and bipancyclic subgraphs. We prove that for the graph has an -factorization, where is an -regular, -connected and bipancyclic graph on vertices, if and only if divides and withhttp://dx.doi.org/10.1016/j.akcej.2018.06.003cycle productfactorization-connectedregularbipancyclic |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Y.M. Borse A.V. Sonawane S.R. Shaikh |
| spellingShingle |
Y.M. Borse A.V. Sonawane S.R. Shaikh Factorizations of the product of cycles AKCE International Journal of Graphs and Combinatorics cycle product factorization -connected regular bipancyclic |
| author_facet |
Y.M. Borse A.V. Sonawane S.R. Shaikh |
| author_sort |
Y.M. Borse |
| title |
Factorizations of the product of cycles |
| title_short |
Factorizations of the product of cycles |
| title_full |
Factorizations of the product of cycles |
| title_fullStr |
Factorizations of the product of cycles |
| title_full_unstemmed |
Factorizations of the product of cycles |
| title_sort |
factorizations of the product of cycles |
| publisher |
Taylor & Francis Group |
| series |
AKCE International Journal of Graphs and Combinatorics |
| issn |
0972-8600 |
| publishDate |
2019-12-01 |
| description |
An -factorization of a graph is a partition of the edge set of into spanning subgraphs (or factors) each of whose components are isomorphic to a graph Let be the Cartesian product of the cycles with for each El-Zanati and Eynden proved that has a -factorization, where is a cycle of length if and only if with We extend this result to get factorizations of into -regular, -connected and bipancyclic subgraphs. We prove that for the graph has an -factorization, where is an -regular, -connected and bipancyclic graph on vertices, if and only if divides and with |
| topic |
cycle product factorization -connected regular bipancyclic |
| url |
http://dx.doi.org/10.1016/j.akcej.2018.06.003 |
| work_keys_str_mv |
AT ymborse factorizationsoftheproductofcycles AT avsonawane factorizationsoftheproductofcycles AT srshaikh factorizationsoftheproductofcycles |
| _version_ |
1724932201453191168 |