## Search

Now showing items 1-9 of 9

#### Variations on a Theme: Graph Homomorphisms

(University of Waterloo, 2013-08-30)

This thesis investigates three areas of the theory of graph homomorphisms: cores of graphs, the homomorphism order, and quantum homomorphisms.
A core of a graph X is a vertex minimal subgraph to which X admits a ...

#### Core Structures in Random Graphs and Hypergraphs

(University of Waterloo, 2013-08-30)

The k-core of a graph is its maximal subgraph with minimum degree at least k. The study of k-cores in random graphs was initiated by Bollobás in 1984 in connection to k-connected subgraphs of random graphs. Subsequently, ...

#### Diameter and Rumour Spreading in Real-World Network Models

(University of Waterloo, 2015-04-20)

The so-called 'small-world phenomenon', observed in many real-world networks, is that there is a short path between any two nodes of a network, whose length is much smaller that the network's size, typically growing as a ...

#### Morphing planar triangulations

(University of Waterloo, 2014-06-09)

A morph between two drawings of the same graph can be thought of as a continuous deformation between the two given drawings. A morph is linear if every vertex moves along a straight line segment from its initial position ...

#### Properties of random graphs

(University of Waterloo, 2008-09-23)

The thesis describes new results for several problems in random graph theory.
The first problem relates to the uniform random graph model in
the supercritical phase; i.e. a graph, uniformly distributed, on $n$ vertices
and ...

#### Multigraphs with High Chromatic Index

(University of Waterloo, 2009-07-22)

In this thesis we take a specialized approach to edge-colouring by focusing exclusively on multigraphs with high chromatic index. The bulk of our results can be classified into three categories. First, we prove results ...

#### FACES OF MATCHING POLYHEDRA

(University of Waterloo, 2016-09-30)

Let G = (V, E, ~) be a finite loopless graph, let
b=(bi:ieV) be a vector of positive integers. A
feasible matching is a vector X = (x.: j e: E)
J
of nonnegative
integers such that for each node i of G, the sum of ...

#### Constructing Cospectral and Comatching Graphs

(University of Waterloo, 2019-07-18)

The matching polynomial is a graph polynomial that does not only have interesting mathematical properties, but also possesses meaningful applications in physics and chemistry. For a simple graph, the matching polynomial ...

#### On Geometric Drawings of Graphs

(University of Waterloo, 2018-04-18)

This thesis is about geometric drawings of graphs and their topological generalizations.
First, we study pseudolinear drawings of graphs in the plane. A pseudolinear drawing is one in which every edge can be extended ...