Loading...
Extremal permutations in routing cycles
He, Junhua Valentin, Louis A. Yin, Xiaoyan Yu, Gexin
He, Junhua
Valentin, Louis A.
Yin, Xiaoyan
Yu, Gexin
Abstract
Let G be a graph whose vertices are labeled 1, ... , n, and pi be a permutation on [n] := {1, 2, ... , n}. A pebble p(i) that is initially placed at the vertex i has destination pi(i) for each i is an element of [n]. At each step, we choose a matching and swap the two pebbles on each of the edges. Let rt(G, pi), the routing number for pi, be the minimum number of steps necessary for the pebbles to reach their destinations. Li, Lu and Yang proved that rt(C-n, pi) = 5, if rt(C-n, pi) = n-1, then pi = 23 ... n1 or its inverse. By a computer search, they showed that the conjecture holds for n < 8. We prove in this paper that the conjecture holds for all even n >= 6.
Description
Date
2016-09-19
Journal Title
Journal ISSN
Volume Title
Publisher
Collections
Download Dataset
Files
Loading...
extremal.pdf
Adobe PDF, 317.19 KB
Rights Holder
Usage License
Embargo
Research Projects
Organizational Units
Journal Issue
Keywords
Citation
Advisor
Department
Mathematics