Almost resolvable even cycle decompositions of (Ku × Kg)(λ)
In this paper, we prove that there exists an almost resolvable [Formula: see text]-cycle decomposition of [Formula: see text], (where × represents tensor product of graphs) for all even integers [Formula: see text] with some possible exceptions.
Authors
- A. Muthusamy (ORCID: https://orcid.org/0000-0001-9014-6916)
- S. Duraimurugan
Institutions
- Periyar University (IN)
Publication Details
- Journal
- Discrete Mathematics Algorithms and Applications
- Published
- 2024-08-21
- DOI
- https://doi.org/10.1142/s1793830924500770
- Primary Topic
- Coding theory and cryptography
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Periyar University
- Science and Engineering Research Board