16 citations · 17 across the 7 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.CO2011
Properties of Generalized Derangement Graphs
Hannah Jackson, Kathryn Nyman, Les Reid
A permutation sigma in Sn is a k-derangement if for any subset X = {a1, . . ., ak} \subseteq [n], {sigma(a1), . . ., sigma(ak)} is not equal to X. One can form the k-derangement gr…
math.CO2011★ 1 cited
Weighted pebbling numbers on graphs
Stephanie Jones, Joshua D. Laison, Cameron McLeman +1
We expand the theory of pebbling to graphs with weighted edges. In a weighted pebbling game, one player distributes a set amount of weight on the edges of a graph and his opponent…