Diameter of Cayley graphs generated by transposition trees

  title={Diameter of Cayley graphs generated by transposition trees},
  author={Ashwin Ganesan},
  • A. Ganesan
  • Published 27 February 2012
  • Computer Science, Mathematics
  • ArXiv
A problem of practical and theoretical interest is to determine or estimate the diameter of various families of Cayley networks. The previously known estimate for the diameter of Cayley graphs generated by transposition trees is an upper bound given in the oft-cited paper of Akers and Krishnamurthy (1989). In this work, we first assess the performance of their upper bound. We show that for every $n$, there exists a tree on $n$ vertices, such that the difference between the upper bound and the… 
Bounding the diameter of cayley graphs generated by specific transposition trees
This article compares various methods for determining an upper bound on the diameter value of a Cayley graph and exact diameters for novel classes of trees are identified.
Upper Bounds for Sorting Permutations with a Transposition Tree
For a class of trees, it is proved that the new upper bounds are tighter than β and f(Γ), on average and in most of the cases.
Erratum: "Upper Bounds for Sorting Permutations with a Transposition Tree"
The authors' upper bounds are tighter than f(Γ ) and β, on average and in most of the cases, and it is proved that the new upper boundsare tighter than β for a class of trees.
Hardness of Token Swapping on Trees
This work identifies a broad class of algorithms that encompass all three known polynomial-time algorithms that achieve the best known approximation factor (which is 2) and shows that no such algorithm can achieve an approximation factor less than 2.
The Girth of Cayley graphs of Sylow 2-subgroups of symmetric groups $S_{2^n}$ on diagonal bases
A diagonal base of a Sylow 2-subgroup $P_n(2)$ of symmetric group $S_{2^n}$ is a minimal generating set of this subgroup consisting of elements with only one non-zero coordinate in the polynomial
Token Swapping on Trees
A generalized problem---weighted coloured token swapping---is NP-complete on trees, but solvable in polynomial time on paths and stars, and the goal is to get every token to a vertex of the same colour, andThe cost of a swap is the sum of the weights of the two tokens involved.
Better approximation algorithm for point-set diameter
This work proposes a new $(1+O(\varepsilon)-approximation algorithm with running time of $O(n+ 1/\varpsilon^{\frac{(d-1)}{2}})$ for computing the diameter of a set of points in the d-dimensional Euclidean space for a fixed dimension.


Diameter of Cayley graphs of permutation groups generated by transposition trees
This work provides an algorithm that obtains an estimate of the diameter, but which requires only on the order of (polynomial in) $n$ computations; the value obtained by the algorithm is less than or equal to the previously known diameter upper bound.
Internode Distance and Optimal Routing in a Class of Alternating Group Networks
The distance between any two nodes in ANn is characterized and an optimal (shortest-path) routing algorithm for this class of networks is presented.
A Class of Arc-Transitive Cayley Graphs as Models for Interconnection Networks
It is proved that for any graph in the class of Cayley graphs there exists a gossiping protocol which exhibits attractive features, and an algorithm for constructing such a protocol is given.
Gossiping in Cayley Graphs by Packets
A lower bound of N−1/δ is given, where δ is the minimum degree, and it is shown that it is attained in Cayley symmetric digraphs with some additional properties, which implies the existence of an optimal gossiping protocol for classical networks like hypercubes, k-dimensional tori, and star-graphs.
The Complexity of Finding Minimum-Length Generator Sequences
Topological Structure and Analysis of Interconnection Networks
  • Junming Xu
  • Computer Science
    Network Theory and Applications
  • 2001
This book provides the most basic problems, concepts, and well-established results from the topological structure and analysis of interconnection networks in the graph-theoretic language for undergraduates and postgraduates specializing in computer science and applied mathematics.