Some Holey designs and Incomplete designs for the join graph of k1 and C4 with a pendent edge

DOI

10.2991/iccsee.2013.485How to use a DOI?

Keywords

G-packing design, G -covering design, Holey G -design

Abstract

A G -design of is a pair , where is the vertex set of and is a collection of subgraphs of , such that each block is isomorphic to and any two distinct vertices in are joined in exact (at most, at least) blocks of . In this paper, we will discuss some holey designs and incomplete designs for the join graph of and with a pendent edge for .

Copyright

© 2013, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Xiaoshan Liu
AU  - Qi Wang
PY  - 2013/03
DA  - 2013/03
TI  - Some Holey designs and Incomplete designs for the join graph of k1 and C4 with a pendent edge
BT  - Proceedings of the 2nd International Conference on Computer Science and Electronics Engineering (ICCSEE 2013)
PB  - Atlantis Press
SP  - 1933
EP  - 1936
SN  - 1951-6851
UR  - https://doi.org/10.2991/iccsee.2013.485
DO  - 10.2991/iccsee.2013.485
ID  - Liu2013/03
ER  -