Current Proceedings on Technology
Nonexistences of the Packing and Covering Designs for the Join Graph of 1 K and 4 C with a Pendent Edge
Yazarlar: Xiaoshan Liu, Qi Wang
Cilt 3 , Sayı - , 2013 , Sayfalar -
Konular:-
Anahtar Kelimeler:G -packing design,G -covering design,Holey G -design
Özet: LetKv be the complete multigraph with v vertices. A G -design G -GD (v) of Kv is a pair (X,B) , where X isthe vertex set of Kv and B is a collection of subgraphs of Kv , called blocks, such that each block is isomorphicto G and any two distinct vertices in Kv are joined in exact (at most, at least) blocks of B . In this paper, wewill discuss nonexistences and constructions of the maximum packing designs and the minimum coveringdesigns for the join graph of K1 and C4 with a pendent edge for �?�1.
ATIFLAR
Atıf Yapan Eserler
KAYNAK GÖSTER
BibTex
KOPYALA
@article{2013, title={Nonexistences of the Packing and Covering Designs for the Join Graph of 1 K and 4 C with a Pendent Edge}, volume={3}, number={0}, publisher={Current Proceedings on Technology }, author={Xiaoshan Liu, Qi Wang}, year={2013} }
APA
KOPYALA
Xiaoshan Liu, Qi Wang. (2013). Nonexistences of the Packing and Covering Designs for the Join Graph of 1 K and 4 C with a Pendent Edge (Vol. 3). Vol. 3. Current Proceedings on Technology .
MLA
KOPYALA
Xiaoshan Liu, Qi Wang. Nonexistences of the Packing and Covering Designs for the Join Graph of 1 K and 4 C with a Pendent Edge. no. 0, Current Proceedings on Technology , 2013.