Posts by Collection

Two-graphs and NSSDs: An Algebraic Approach

Published in Discrete Applied Mathematics, 2018

A two-graph $(\mathscr V, \Delta)$ is a combinatorial entity consisting of a set $\mathscr V$ together with a collection $\Delta$ of unordered triples of elements of $\mathscr V$, such that there exists a graph $G$ with vertex set $\mathscr V$ … Read more

On Walks and Canonical Double Coverings of Graphs with the Same Main Eigenspace

The relationship between the main eigenvalues of a graph and the number of walks is discussed. The number of walks $N_k$ of length $k$ is expressed solely in terms of the main eigenvalues … Read more

Synthesising Safety Runtime Enforcement Monitors in μHML

Undergraduate dissertation in computer science, 2019

We consider a subset $\text{sHML}$ of formulæ in the Hennessy-Milner Logic with recursion ($\mu\textrm{HML}$) which are enforcable through suppressions … Read more

On the Walks and Bipartite Double Coverings of Graphs with the same Main Eigenspace

In press

The main eigenvalues of a graph $G$ are those eigenvalues of the $(0,1)$-adjacency matrix $\mathbf A$ having a corresponding eigenvector not orthogonal to $\mathbf j=(1,\dots,1)$. The CDC of a graph $G$ is the direct product $G\times K_2$ … Read more

Published: