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 ...
  • P-Generating Polynomials and the P-Fractal of a Graph 

    Cameron, Ben (2014-08-19)
    We define the P -generating polynomial for a graph G and property P as the generating polynomial for the number of P-subgraphs of G of each size. This polynomial is a generalization of the independence polynomial and so ...