Now showing items 7-9 of 9

  • Square Root Finding In Graphs 

    Karimi, Majid (Brock University, 2013-01-24)
    Abstract: Root and root finding are concepts familiar to most branches of mathematics. In graph theory, H is a square root of G and G is the square of H if two vertices x,y have an edge in G if and only if x,y are of ...
  • The von Neumann Minimax Theorem and its relatives and a study of externality in on-line auctions 

    Malekan, Samaneh (2012-03-30)
    This work consists of a theoretical part and an experimental one. The first part provides a simple treatment of the celebrated von Neumann minimax theorem as formulated by Nikaid6 and Sion. It also discusses its relationships ...
  • Zero-sum problems in finite cyclic groups 

    Plyley, Chris. (Brock University, 2009-01-28)
    The purpose of this thesis is to investigate some open problems in the area of combinatorial number theory referred to as zero-sum theory. A zero-sequence in a finite cyclic group G is said to have the basic property if ...