4 papers
Sedentary quantum walks on bipartite and planar graphs
Karen Meagher, Hermie Monterde
If a quantum walk starting on a vertex tends to stay at home, then that vertex is said to be sedentary. We prove that almost all planar graphs and almost all trees contain at least…
On the second largest eigenvalue of certain graphs in the perfect matching association scheme
Himanshu Gupta, Allen Herman, Alice Lacaze-Masmonteil +2
The perfect matching association scheme is a set of relations on the perfect matchings of the complete graph on vertices. The relations between perfect matchings are defined b…
The intersection density of cubic arc-transitive graphs with -arc-regular full automorphism group equal to
Karen Meagher, Andriaherimanana Sarobidy Razafimahatratra
The \emph{intersection density} of a transitive permutation group is the ratio between the largest size of a subset of in which any two agree on a…
The -Analogue of Zero Forcing for Certain Families of Graphs
Shaun Fallat, Neha Joshi, Roghayeh Maleki +6
Zero forcing is a combinatorial game played on a graph with the ultimate goal of changing the colour of all the vertices at minimal cost. Originally this game was conceived as a on…