## Combinatorial Mathematics, Optimal Designs, and Their ApplicationsCombinatorial Mathematics, Optimal Designs, and Their Applications |

### What people are saying - Write a review

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

### Contents

1 | |

7 | |

19 | |

31 | |

Chapter 5 On permutation cliques | 41 |

Chapter 6 Some properties of perfect matroid designs | 57 |

Chapter 7 A combinatorial interpretation of the Seidel generation of Genocchi numbers | 77 |

Chapter 8 A survey of problems in combinatorial number theory | 89 |

Chapter 17 Partitioning of the minimum essential set construction problem | 219 |

Chapter 18 Optimal design theory in relation to combinatorial design | 225 |

Chapter 19 The asymptotic number of lattices | 243 |

Chapter 20 A new statistics on words | 251 |

Chapter 21 Some results on the existence of squares | 257 |

Chapter 22 Intersection graphs of kuniform hypergraphs | 275 |

Chapter 23 On some enumeration problems in graph theory | 281 |

Chapter 24 Some remarks on amicable orthogonal designs | 289 |

Chapter 9 Residuallycomplete graphs | 117 |

Chapter 10 A combinatorial proof of Jacobis identity | 125 |

Chapter 11 From Nim to Go | 137 |

Chapter 12 Configurations in a plane of order ten | 157 |

Chapter 13 Construction of optimal codes and optimal fractional factorial designs using linear programming | 175 |

Chapter 14 Combinatorial topology and the trade off method in BIB designs | 189 |

Chapter 15 Block designs with cyclic block structure | 201 |

Chapter 16 On restricted bases for finite fields | 215 |

Chapter 25 On the number of nonisomorphic designs in a repeated measurement experiment | 293 |

Chapter 26 Intersection theorems on structures | 301 |

Chapter 27 Enumeration and representation of nonisomorphic bipartite graphs | 315 |

Chapter 28 Decompositions of rational convex polytopes | 333 |

Chapter 29 Rotors in graph theory | 343 |

Chapter 30 Embedding graphs in the planealgorithmic aspects | 349 |

Chapter 31 Hyperclaw decomposition of complete hypergraphs | 385 |

### Other editions - View all

Combinatorial Mathematics, Optimal Designs, and Their Applications Jaya Srivastava No preview available - 1980 |

### Common terms and phrases

alternating permutations arithmetic progressions automorphism backedges BIBD bijection called classes colored combinatorial complete graphs components COMPONENTS(e computed condition conﬁguration conjecture consider construction contains Corollary corresponding decomposable of degree deﬁned deﬁnition denote digraph directed graph disjoint edges eigenvalues elements example exists factorial designs factors ﬁeld ﬁnd ﬁnding ﬁrst ﬁxed ﬂats function Genocchi geometry given integers graph G Graph Theory Hadamard Hadamard matrices Hence hypergraph implies inﬁnite integers intersection isomorphic k-HC decomposable Latin squares Lemma linear linear code lower bound maps Math matrix matroid maximal minimum essential set nonisomorphic North-Holland Publishing Company number theory obtained optimality orthogonal ovals pairs parameters partition PATH(e PATR(G permutation planar PMD of rank polynomial prime problem projective plane proof Proposition proved regular graph result satisﬁes satisfying Section SEGFO(e SEGGR(e SEGLST(e segment sequence skew Room square Statist subgraph subsets Suppose symmetric Theorem triangles vectors h vertex vertices W.T. Tutte