A survey of combinatorial theory
Some classical and modern topics in finite geometrical structures; Balanced hypergraphs and some applications to graph theory; A strongly regular graph derived from the perfect ternary Golay code; Characterization problems of combinatorial graph theory; Line-minimal graphs with cyclic group; Circle geometry in hygher dimensions; Bose as teacher - the early years; Construction of symmetric hadamard matrices.
9 pages matching sorting network in this book
Results 1-3 of 9
What people are saying - Write a review
We haven't found any reviews in the usual places.
Balanced hypergraphs and some applications to graph theory
Characterization problems of combinatorial graph theory
Lineminimal graphs with cyclic group
17 other sections not shown
Other editions - View all
adjacency matrix adjacent Algebra array of strength association scheme asymmetrical factorial balanced array balanced incomplete block bibd binary Canad clique code word columns combinatorial problem conjecture consider construction contains corresponding cyclic D. K. Ray-Chaudhuri defined denote digraphs distinct distribution edges elements Erdos errors exists factorial designs finite fractional replicates given graph G Harary Hence hypergraph incidence matrix incomplete block designs independent integers intersect lattice Lemma line graph line-minimal linear lower bound majority decoding Math methods North-Holland Publishing Company number theory obtained order statistics orthogonal array pair parameters parity check partial geometry partially balanced partition points polyn˘mes polynomial prime Proc projective plane proof properties proved R. C. Bose random variables S. S. Shrikhande satisfies sequence sorting network space Srivastava strongly regular graph subset symbols symmetric Theorem treatments values vertex vertices