49 citations · 78 across the 41 of their papers we have counts for
6 papers · 1 filter
On the Relationships between Zero Forcing Numbers and Certain Graph Coverings
Fatemeh Alinaghipour Taklimi, Shaun Fallat, Karen Meagher
The zero forcing number and the positive zero forcing number of a graph are two graph parameters that arise from two types of graph colourings. The zero forcing number is an upper…
An Erdős-Ko-Rado theorem for subset partitions
Adam Dyck, Karen Meagher
A -subset partition, or -subpartition, is a -subset of an -set that is partitioned into distinct classes, each of size . Two -subpart…
The Erdős-Ko-Rado property for some permutation groups
Bahman Ahmadi, Karen Meagher
A subset in a group is intersecting if for any pair of permutations in the subset there is an such that . If the stabiliz…
The Erdős-Ko-Rado property for some 2-transitive groups
Bahman Ahmadi, Karen Meagher
A subset of a group G of Sym(n) is intersecting if for any pair of permutations there is an in {1,2,...,n} such that . It has been shown, using an algeb…
Minimum number of distinct eigenvalues of graphs
Bahman Ahmadi, Fatemeh Alinaghipour, Michael S. Cavers +3
The minimum number of distinct eigenvalues, taken over all real symmetric matrices compatible with a given graph , is denoted by . Using other parameters related to , b…
A new proof for the Erdős-Ko-Rado Theorem for the alternating group
Bahman Ahmadi, Karen Meagher
A subset of the alternating group on points is {\it intersecting} if for any pair of permutations in , there is an element such that $π(i)=σ(i…