Two new combinatorial problems involving dominating sets for lottery schemes
Thesis (PhD (Mathematical Sciences. Applied Mathematics))--University of Stellenbosch, 2004. === Suppose a lottery scheme consists of randomly selecting an unordered winning n-subset from a universal set of m numbers, while a player participates in the scheme by purchasing a playing set of any numb...
Main Author: | Grundlingh, Werner R. |
---|---|
Other Authors: | Van Vuuren, J. H. |
Format: | Others |
Language: | en |
Published: |
Stellenbosch : University of Stellenbosch
2006
|
Subjects: | |
Online Access: | http://hdl.handle.net/10019.1/1388 |
Similar Items
-
Higher order domination of graphs
by: Benecke, Stephen
Published: (2011) -
Vertex-criticality of the domination parameters of graphs
by: Roux, Adriana
Published: (2011) -
Criticality of the lower domination parameters of graphs
by: Coetzer, Audrey
Published: (2008) -
The crossing number of a graph in the plane
by: Winterbach, Wynand
Published: (2008) -
Bounds for Ramsey numbers in multipartite graphs
by: Stipp, Eugene Heinz
Published: (2012)