Abstract
Cayley graphs have been well-studied as a model for interconnection networks due to their low diameter, optimal fault tolerance, and algorithmic efficiency, among other properties. A problem of practical and theoretical interest is to determine or estimate the diameter of Cayley graphs. Let Γ be a Cayley graph on n! vertices generated by a transposition tree on vertex set {1,2,…,n}. In an oft-cited paper [1], it was shown that the diameter of Γ is bounded as:
where the maximization is over all permutations π in the symmetric group, c(π) denotes the number of cycles in π, and \(\mathop{\mathrm{dist}}\nolimits _T\) is the distance function in T. It is of interest to determine how far away this upper bound can be from the true diameter value in the worst case and for which families of graphs this bound should be utilized or not utilized. In this work, we investigate the worst case performance of this upper bound. We show that for every n, there exists a transposition tree on n vertices such that the maximum possible difference Δ n between the upper bound and the true diameter value is at least n − 4. The lower bound we provide for Δ n is seen to be best possible, and an open problem is to determine an upper bound for Δ n .
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Akers, S.B., Krishnamurthy, B.: A group-theoretic model for symmetric interconnection networks. IEEE Trans. Comput. 38(4), 555–566 (1989)
Alspach, B.: Cayley graphs with optimal fault tolerance. IEEE Trans. Comput. 41(10), 1337–1339 (1992)
Annexstein, F., Baumslag, M., Rosenberg, A.L.: Group action graphs and parallel architectures. SIAM J. Comput. 19(3), 544–569 (1990)
Berge, C.: Principles of Combinatorics. Academic Press, New York (1971)
Bermond, J.C., Kodate, T., Perennes, S.: Gossiping in Cayley Graphs by Packets. In: Deza, M., Manoussakis, I., Euler, R. (eds.) CCS 1995. LNCS, vol. 1120, pp. 301–315. Springer, Heidelberg (1996)
Biggs, N.L.: Algebraic Graph Theory, 2nd edn. Cambridge University Press, Cambridge (1994)
Bollobás, B.: Modern Graph Theory. Graduate Texts in Mathematics, vol. 184. Springer, New York (1998)
Chen, B., Xiao, W., Parhami, B.: Internode distance and optimal routing in a class of alternating group networks. IEEE Trans. Computers 55(12), 1645–1648 (2006)
Godsil, C., Royle, G.: Algebraic Graph Theory. Graduate Texts in Mathematics, vol. 207. Springer, New York (2001)
Ganesan, A.: On a bound for the diameter of Cayley networks of symmetric groups generated by transposition trees (2011), http://arxiv.org/abs/1111.3114v1
The GAP Group. GAP-Groups, Algorithms, and Programming, Version 4.4.12 (2008), http://www.gap-system.org
Hahn, G., Sabidussi, G. (eds.): Graph Symmetry: Algebraic Methods and Applications. Kluwer Academic Publishers, Dordrecht (1997)
Heydemann, M.C.: Cayley graphs and interconnection networks. In: Graph Symmetry: Algebraic Methods and Applications, pp. 167–226. Kluwer Academic Publishers, Dordrecht (1997)
Jerrum, M.: The complexity of finding minimum length generator sequences. Theoretical Computer Sci. 36, 265–289 (1985)
Lakshmivarahan, S., Jho, J.-S., Dhall, S.K.: Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey. Parallel Computing 19, 361–407 (1993)
Smith, J.H.: Factoring, into edge transpositions of a tree, permutations fixing a terminal vertex. J. Combinatorial Theory Series A 85, 92–95 (1999)
Vaughan, T.P.: Bounds for the rank of a permutation on a tree. J. Combinatorial Math. Combinatorial Computing 19, 65–81 (1991)
Vaughan, T.P., Portier, F.J.: An algorithm for the factorization of permutations on a tree. J. Combinatorial Math. Combinatorial Computing 18, 11–31 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ganesan, A. (2012). On the Strictness of a Bound for the Diameter of Cayley Graphs Generated by Transposition Trees. In: Balasubramaniam, P., Uthayakumar, R. (eds) Mathematical Modelling and Scientific Computation. ICMMSC 2012. Communications in Computer and Information Science, vol 283. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28926-2_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-28926-2_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28925-5
Online ISBN: 978-3-642-28926-2
eBook Packages: Computer ScienceComputer Science (R0)