49 citations · 78 across the 41 of their papers we have counts for
5 papers · 2 filters
Compressed Cliques Graphs, Clique Coverings and Positive Zero Forcing
Shaun Fallat, Karen Meagher, Abolghasem Soltani +1
Zero forcing parameters, associated with graphs, have been studied for over a decade, and have gained popularity as the number of related applications grows. In particular, it is w…
An Erdős-Ko-Rado theorem for finite 2-transitive groups
Karen Meagher, Pablo Spiga, Pham Huu Tiep
We prove an analogue of the classical Erdős-Ko-Rado theorem for intersecting sets of permutations in finite 2-transitive groups. Given a finite group G acting faithfully and 2-tran…
An algebraic proof of the Erdős-Ko-Rado theorem for intersecting families of perfect matchings
Chris Godsil, Karen Meagher
In this paper we give a proof that the largest set of perfect matchings, in which any two contain a common edge, is the set of all perfect matchings that contain a fixed edge. This…
Intersection theorems for multisets
Karen Meagher, Alison Purdy
Let , and be positive integers. A -multiset of is a collection of integers from the set in which the integers can appear more than once. We us…
Graphs that have a weighted adjacency matrix with spectrum
Karen Meagher, Irene Sciriha
In this paper we completely characterize the graphs which have an edge weighted adjacency matrix belonging to the class of involutions with spectrum equal to $\{ λ_1^{…