Some Holey Designs and Incomplete Designs for the Join Graph of and with a Pendent Edge

Xiao Shan Liu; Qi Wang

doi:10.4028/www.scientific.net/AMM.347-350.2885

Paper Titles

3D Tree Modeling and Visualization Simulation Based on Fractal
p.2869

Effective Methods of Restoring Motion Blurred Images at Arbitrary Direction
p.2874

Research on Evaluating the Logistics Model of B2C Web Store in China
p.2877

Design and Implementation of LAN-Sensitive Information Interception and Analysis System
p.2881

Some Holey Designs and Incomplete Designs for the Join Graph of and with a Pendent Edge
p.2885

Website Information Extraction Based on DOM-Model
p.2889

Application of Binary System to Information Table Based on Rough Set
p.2894

The Strategy of Ontology-Based Semantic Replica in Cloud Storage
p.2898

Research in Virtual Home Roaming System Based on Virtools
p.2905

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 347-350Some Holey Designs and Incomplete Designs for the...

Some Holey Designs and Incomplete Designs for the Join Graph of and with a Pendent Edge

Abstract:

A-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 .

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 347-350)

Pages:

2885-2888

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.347-350.2885

Citation:

Cite this paper

Online since:

August 2013

Authors:

Xiao Shan Liu, Qi Wang

Keywords:

G-Covering Design, G-Packing Design, Holey G-Design

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] B. Alspach and H. Gavlas, Cycle decompositions of Kn and Kn−I, Journal of Combinatorial Theory (B), Vol. 21, 2000, pp.146-155.

DOI: 10.1006/jctb.2000.1996

Google Scholar

[2] J. C. Bermond, C. Huang, A. Rosa and D. Sotteau, Decomposition of complete graphs into isomorphic subgraphs with ﬁve vertices, Ars Combinatoria, Vol. 10, 1980, pp.211-254.

Google Scholar

[3] J. C. Bermond and J. Sch¨onheim, -decomposition of Kn, where G has four vertices or less, Discrete Math. Vol. 19, 1977, pp.113-120.

DOI: 10.1016/0012-365x(77)90027-9

Google Scholar

[4] A. Blinco, On diagonal cycle systems, Australasian Journal of Combinatorics, Vol. 24, 2001, pp.221-230.

Google Scholar

[5] Q. Kang, Y. Du and Z. Tian, Decomposition of into some graph with six vertices and seven edges, unpublished.

Google Scholar

[6] Q. Kang, Y. Du and Z. Tian, Decomposition of complete graph into isomorphic subgraphs with six vertices and seven edges, unpublished.

Google Scholar

[7] C. P. Ma, The graph designs for six graphs with six vertices and nine edges,. Master thesis, in press.

Google Scholar