Karen Meagher

activity

20062026

most citedResolving sets for Johnson and Kneser graphs

49 citations · 78 across the 41 of their papers we have counts for

collaborators

Showing 2020Show all

4 papers · 1 filter

math.CO2020★ 1 cited

On triangles in derangement graphs

Andriaherimanana Sarobidy Razafimahatratra, Karen Meagher, Pablo Spiga

Given a permutation group $G$ , the derangement graph $Γ_{G}$ of $G$ is the Cayley graph with connection set the set of all derangements of $G$ . We prove that, when $G$ is transitive…

math.CO2020

The Erdős-Ko-Rado theorem for $2$ -intersecting families of perfect matchings

Shaun Fallat, Karen Meagher, Mahsa N. Shirazi

A perfect matching in the complete graph on $2 k$ vertices is a set of edges such that no two edges have a vertex in common and every vertex is covered exactly once. Two perfect mat…

math.CO2020★ 1 cited

2-intersecting permutations

Karen Meagher, A. S. Razafimahatratra

In this paper we consider the Erdős-Ko-Rado property for both $2$ -pointwise and $2$ -setwise intersecting permutations. Two permutations $σ, τ \in S y m (n)$ are $t$ -setwise intersecting…

math.CO2020★ 1 cited

An upper bound for the $k$ -power domination number in $r$ -uniform hypergraphs

Joseph S. Alameda, Franklin Kenter, Karen Meagher +1

Generalizing work on graphs, Chang and Roussel introduced $k$ -power domination in hypergraphs and conjectured the upper bound for the $k$ -power domination number for $r$ -uniform hy…

On triangles in derangement graphs

The Erdős-Ko-Rado theorem for 2-intersecting families of perfect matchings

2-intersecting permutations

An upper bound for the k-power domination number in r-uniform hypergraphs

The Erdős-Ko-Rado theorem for $2$ -intersecting families of perfect matchings

An upper bound for the $k$ -power domination number in $r$ -uniform hypergraphs