Proceedings of the Southeastern Conference on Combinatorics, Graph Theory, and Computing, Volume 4Utilitas Mathematica Pub, 1973 - Combinatorial analysis |
From inside the book
Results 1-3 of 37
Page 17
Theorem 3. Every saturated graph G can be obtained uniquely by the following construction : graph Go . Take the sets they form a partition Take a saturated elementary U of the construction in Theorem 2 , X { S1 , ... , S ) of V ( G ) ...
Theorem 3. Every saturated graph G can be obtained uniquely by the following construction : graph Go . Take the sets they form a partition Take a saturated elementary U of the construction in Theorem 2 , X { S1 , ... , S ) of V ( G ) ...
Page 53
... construction of Baumert - Hall arrays by utilizing a construction of L. R. Welch , and ( ii ) finding suitable matrices to put into these arrays . We discuss these results , many of which are due to Richard J. Turyn or the author ...
... construction of Baumert - Hall arrays by utilizing a construction of L. R. Welch , and ( ii ) finding suitable matrices to put into these arrays . We discuss these results , many of which are due to Richard J. Turyn or the author ...
Page 107
... construction balanced incomplete block designs " , Ann . Eugenics 9 ( 1939 ) , 353-399 . R. C. Bose and S.S. ... construction of resolvable BIBD " , Sankhya 25A ( 1963 ) , 393-394 . Ester Seiden , " On a method of construction of partial ...
... construction balanced incomplete block designs " , Ann . Eugenics 9 ( 1939 ) , 353-399 . R. C. Bose and S.S. ... construction of resolvable BIBD " , Sankhya 25A ( 1963 ) , 393-394 . Ester Seiden , " On a method of construction of partial ...
Other editions - View all
Common terms and phrases
2-colorable 4TH S-E CONF abelian group adjacent algorithm array of order balanced incomplete block Baumert-Hall arrays bicritical binary bipartite graph block design boundary colorations braid chain-groups circuit Combinatorial Theory conjecture consider construction contains core cycle defined definition denote digits edges elements equation example exist finite four coloring given graph G Graph Theory Hadamard matrices hamiltonian Hamiltonian graphs Hence hypergraph incidence geometry incidence matrix incomplete block design integer isomorphic Jennifer Seberry Jennifer Wallis k-tuples labeled Lemma lower bound Math matroid maximal snakes minimal n-set nodes obtained occurs pair parameters partially ordered set partition perfect 1-factorization permutation permutation groups planar graph polynomial prime power problem PROC Proof reduced sequences Room square SAN DIEGO satisfy skew Stanton starter subcube subset Suppose symmetric snake T-sequence tactical configurations Theorem tree University upper bound values vertices wreath