University of Manitoba

Non--isomorphic graphs with isomorphic canonical double cover (CDC) have the same number of walks of arbitrary length from corresponding vertices of the same degree. The total number of walks, for a specific length, depends only on the main...

An interesting question in spectral graph theory is about the structure of the eigenvectors of matrices associated with graphs. A graph is weakly Hadamard diagonalizable (WHD) if its Laplacian matrix L can be diagonalized with a weakly Hadamard...

For r ≥ 1, a graph has r-friendship property if every pair of vertices has exactly r common neighbours. The motivation for this definition is from the friendship theorem, which is on the graphs with 1-friendship property. The friendship theorem...

In this talk I will talk about some of my favorite problems which remain open in the field of continuous-time quantum walks in graphs.

Kemeny's constant is an interesting and useful quantifier of how well-connected the states of a Markov chain are. Though it was first introduced in the 1960s, interest in this concept has recently exploded. This talk will provide an introduction to...

Quantum computing is believed to provide many advantages over traditional computing, particularly considering the speed at which computations can be performed. One of the challenges that needs to be resolved in order to construct a quantum computer...