Proceedings of the Fifteenth Southeastern Conference on Combinatorics, Graph Theory and Computing Held at Louisiana State University, March 5-8, 1984. |
From inside the book
Results 1-3 of 12
Page 305
... blocks ) . The collection C is said to be a ( 1,3 ) - cover of order v if every triple of distinct points occurs in a unique block of C and every block contains at least three points . The number g ( 1,3 ; v ) is de- fined to be the ...
... blocks ) . The collection C is said to be a ( 1,3 ) - cover of order v if every triple of distinct points occurs in a unique block of C and every block contains at least three points . The number g ( 1,3 ; v ) is de- fined to be the ...
Page 306
some block contains all but one point of V. Such a cover contains 1 + ( " 21 ) blocks . Let C be a ( 1,3 ) -cover of order v , and let z be a point of C. Then the set of blocks C1 = { B \ { z } : z € B , B € C } 3 is called the derived ...
some block contains all but one point of V. Such a cover contains 1 + ( " 21 ) blocks . Let C be a ( 1,3 ) -cover of order v , and let z be a point of C. Then the set of blocks C1 = { B \ { z } : z € B , B € C } 3 is called the derived ...
Page 312
... block B in P there exists a nonempty block A in P such that every vertex in block A dominates every vertex in block B. We routinely observe that a transmitter cannot belong to any block of a dominance partition , hence there cannot ...
... block B in P there exists a nonempty block A in P such that every vertex in block A dominates every vertex in block B. We routinely observe that a transmitter cannot belong to any block of a dominance partition , hence there cannot ...
Contents
H Niederhausen v | 5 |
Palem and D S Fussel | 13 |
Paoli and W T Trotter | 19 |
Copyright | |
26 other sections not shown
Common terms and phrases
activity algorithm asymptotic cost authentication system automorphism average bijection bitog block C₁ coDP combinatorial Computer coNP construction contains Corollary corresponding cycle permutation graphs defined denote determine disjoint dominating set embedded encoding rule equivalent example exists Figure finite flag transitive maps G₂ given graph embedded graph G Graph Theory H(IMS Hamiltonian Hamiltonian cycle hence holey SOLSSOM hyperedge hypergraph integer isomorphic labeled left-right paths Lemma length m-gons makespan matched trees Math move-to-front node NP coNP NP-complete number of edges number of vertices O(nlogn obtained optimal strategy oriented pair parameters partition permutation graphs planar graphs points polygons Proof RD-set resource type sample scheduling sequence series-parallel graph signed graph SOLSSOM of type subgraph subset surface surjections symmetrical map Theorem transmitter triangles two-graph v¹¹ v¹º Venn diagram vertex W.T. Tutte weak records