Now showing items 1-7 of 7

  • A Brief Exploration of Total Colouring 

    MacKeigan, Kyle
    A total colouring of a graph is an assignment of colours to the edges and vertices such that adjacent objects receive different colours. In this thesis, we prove partial results towards the Total Colouring Conjecture which ...
  • Burning a Graph as a Model for the Spread of Social Contagion 

    Roshanbin, Elham
    The spread of social contagion is an active area in social network analysis. Assume that we want to spread a message among all the users of a network. Knowing the structure of the network, we may ask how fast can we do ...
  • DOMINATION POLYNOMIALS: A BRIEF SURVEY AND ANALYSIS 

    Beaton, Iain
    A dominating set S of a graph G of order n is a subset of the vertices of G such that every vertex is either in S or adjacent to a vertex of S. The domination polynomial of G, denoted D(G, x), is the generating polynomial ...
  • EXISTENTIALLY CLOSED PROPERTY IN DIRECTED INFINITE GRAPHS 

    Shi, Zhengnan
    Graph theory abounds with applications inside mathematics itself, and in computer science, and engineering. One direction of research within graph theory is the topic of infinite graphs, which is the focus of this thesis. ...
  • On the Neighbourhood Polynomial 

    Day, Dylan
    The neighbourhood polynomial of a graph is the generating function for the neighbourhood complex, which contains all subsets of vertices which have a common neighbour. We begin with some formulas for computing the neighbourhood ...
  • SAFE GAME OF COMPETITIVE DIFFUSION 

    Vautour, Celeste (2014-04-03)
    Competitive Diffusion is a recently introduced game-theoretic model for the spread of information through social networks. The model is a game on a graph with external players trying to reach the most vertices. In this ...
  • Well-Distributed Sets on Graphs 

    Barrett, Jordan
    Location theory is a topic widely researched in mathematics and computer science. The goal of this thesis will be to propose a new method for choosing vertices on a graph “optimally”, in terms of spread, by generalizing ...