Publications

Abstract : The Pancake graph() represents the group of all permutations on n elements, namely , with respect to the generating set containing all prefix reversals. The diameter of a graph is the maximum of all distances on the graph, where the distance between two vertices is the shortest path between them. In the case of the , it is the maximum of the shortest generating sequence of each permutation in . Here we propose a method to realise better upper bounds to the diameter of that has its focus on Graph Theoretical concepts rather than Algebra.