Now showing items 1-2 of 2

  • On Network Reliability 

    Cox, Danielle (2013-06-24)
    The all terminal reliability of a graph G is the probability that at least a spanning tree is operational, given that vertices are always operational and edges independently operate with probability p in [0,1]. In this ...
  • Simplicial Complexes of Placement Games 

    Huntemann, Svenja (2013-08-23)
    Placement games are a subclass of combinatorial games which are played on graphs. In this thesis, we demonstrate that placement games could be considered as games played on simplicial complexes. These complexes are constructed ...