## Ars Combinatoria, Volume 6Department of Combinatorics and Optimization, University of Waterloo., 1978 - Combinatorial analysis |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Linear Orderings Satisfying Certain Constraints | 19 |

On the Structure of Singer Sets Part | 39 |

On Some New Classes of BDGraphs | 57 |

Copyright | |

13 other sections not shown

### Common terms and phrases

2-reconstructible association scheme assume automorphism block design cards Combinatorial comma-free code connected graph construction contains contradiction COROLLARY defined Definition denote design of type disconnected graphs disjoint circles double cover hypergraph elements equivalence class final digram GF(q given graph G Hadamard matrices Hence incomplete block designs initial digram integers intersection involution isomorphism classes Jennifer Seberry KJ Kl Kl KJ Kl Kl Kl Kl Ul LEMMA Let G m-associate matrix of order middle letter n-BD-graph obtained orthogonal designs pair pairwise disjoint pairwise disjoint edges parallel system partial parallel classes partially balanced permutation positive integers prime power prove reconstruction conjecture representing the sequence resolvable quadruple system result secant skew Room square skew-Hadamard matrix SPBIBD square of side Steiner triple systems strongly regular graph subsets subsystem of order Suppose system of order transversal design Ul Kl Ul Ul Ul University of Waterloo unordered k-tuple vertex vertex-deleted subgraph vertices