Publication:
Orthogonal cycle systems with cycle length less than 10

Placeholder

Departments

School / College / Institute

Program

KU Authors

Co-Authors

Publication Date

Language

Embargo Status

Journal Title

Journal ISSN

Volume Title

Alternative Title

Abstract

An H-decomposition of a graph G is a partition of the edge set of G into subsets, where each subset induces a copy of the graph H. A k-orthogonal H-decomposition of G is a set of kH-decompositions of G such that any two copies of H in distinct H-decompositions intersect in at most one edge. When G = K-v, we call the H-decomposition an H-system of order v. In this paper, we consider the case H is an l-cycle and construct a pair of orthogonal l-cycle systems for all admissible orders when l is an element of {5, 6, 7, 8, 9}, except when l = v.

Source

Publisher

John Wiley and Sons Inc

Subject

Mathematics

Citation

Has Part

Source

Journal of Combinatorial Designs

Book Series Title

Edition

DOI

10.1002/jcd.21921

item.page.datauri

Link

Rights

Copyrights Note

Endorsement

Review

Supplemented By

Referenced By

0

Views

0

Downloads

View PlumX Details