On m-cycle holey systems

Zhihe Liang; Hung-Lin Fu; Wentao Wang

doi:10.1080/09720529.2016.1160511

On m-cycle holey systems

Zhihe Liang^*, Hung-Lin Fu, Wentao Wang

^*Corresponding author for this work

Department of Applied Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

Let G^υ _u denote the graph K_υ\K_u if both u and υ are odd, and (K_υ–F₁)\(K_u–F₂) if both u and υ are even, where F₁ is a 1-factor of K_υ and F₂ is a 1-factor of K_u with F₂⊆F₁. In this paper, we study the existence problem of m-cycle design of G^υ _u. By using direct and recurssive constructions, we obtain several new m-cycle design of G^υ _u.

Original language	English
Pages (from-to)	1637-1649
Number of pages	13
Journal	Journal of Discrete Mathematical Sciences and Cryptography
Volume	20
Issue number	8
DOIs	https://doi.org/10.1080/09720529.2016.1160511
State	Published - 17 Nov 2017

Keywords

Embedding
Holy design
m-cycle design
Packing

Access to Document

10.1080/09720529.2016.1160511

Link to publication in Scopus

Fingerprint Dive into the research topics of 'On m-cycle holey systems'. Together they form a unique fingerprint.

Cite this

@article{f5aab66b4f2547aa9638d3262e5a12dd,

title = "On m-cycle holey systems",

abstract = "Let Gυ u denote the graph Kυ\Ku if both u and υ are odd, and (Kυ–F1)\(Ku–F2) if both u and υ are even, where F1 is a 1-factor of Kυ and F2 is a 1-factor of Ku with F2⊆F1. In this paper, we study the existence problem of m-cycle design of Gυ u. By using direct and recurssive constructions, we obtain several new m-cycle design of Gυ u.",

keywords = "Embedding, Holy design, m-cycle design, Packing",

author = "Zhihe Liang and Hung-Lin Fu and Wentao Wang",

year = "2017",

month = nov,

day = "17",

doi = "10.1080/09720529.2016.1160511",

language = "English",

volume = "20",

pages = "1637--1649",

journal = "Journal of Discrete Mathematical Sciences and Cryptography",

issn = "0972-0529",

publisher = "Taylor and Francis Ltd.",

number = "8",

}

TY - JOUR

T1 - On m-cycle holey systems

AU - Liang, Zhihe

AU - Fu, Hung-Lin

AU - Wang, Wentao

PY - 2017/11/17

Y1 - 2017/11/17

N2 - Let Gυ u denote the graph Kυ\Ku if both u and υ are odd, and (Kυ–F1)\(Ku–F2) if both u and υ are even, where F1 is a 1-factor of Kυ and F2 is a 1-factor of Ku with F2⊆F1. In this paper, we study the existence problem of m-cycle design of Gυ u. By using direct and recurssive constructions, we obtain several new m-cycle design of Gυ u.

AB - Let Gυ u denote the graph Kυ\Ku if both u and υ are odd, and (Kυ–F1)\(Ku–F2) if both u and υ are even, where F1 is a 1-factor of Kυ and F2 is a 1-factor of Ku with F2⊆F1. In this paper, we study the existence problem of m-cycle design of Gυ u. By using direct and recurssive constructions, we obtain several new m-cycle design of Gυ u.

KW - Embedding

KW - Holy design

KW - m-cycle design

KW - Packing

UR - http://www.scopus.com/inward/record.url?scp=85041172257&partnerID=8YFLogxK

U2 - 10.1080/09720529.2016.1160511

DO - 10.1080/09720529.2016.1160511

M3 - Article

AN - SCOPUS:85041172257

VL - 20

SP - 1637

EP - 1649

JO - Journal of Discrete Mathematical Sciences and Cryptography

JF - Journal of Discrete Mathematical Sciences and Cryptography

SN - 0972-0529

IS - 8

ER -