Graph automorphisms with maximal projection distances
This paper introduces diametrical graph automorphisms. A graph automorphism is called diametrical if it has the property that the distance between each vertex and its image is equal to the diameter of the graph. The structure of diametrically automorphic graphs is examined. The complexity of recognizing these graphs is shown to be NP-complete in general, while efficient algorithms for cographs and circular arc graphs are developed. The notion of distance lower bounded automorphism is introduced in order to apply the results on diametrical automorphisms to a wider range of automorphisms.
Unable to display preview. Download preview PDF.
- Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.Google Scholar
- László Babai. Automorphism groups, isomorphism, reconstruction. In R. Graham, M. Grötschel, and L. Lovász, editors, Handbook of Combinatorics, chapter 27, pages 1447–1540. Elsevier Science, 1995.Google Scholar
- Fred Buckley. Self-centered graphs. In Graph Theory and its Applications: East and West: Proceedings of the First China-USA International Graph Theory Conference, volume 576 of Annals of the New York Academy of Sciences, pages 71–78, 1989.Google Scholar
- Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. The MIT Press, 1990.Google Scholar
- E.M. Eschen and J.P. Spinrad. An O(n 2) algorithm for circular-arc graph recognition. In Proc. of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 128–137, 1993.Google Scholar
- Martin Charles Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, 1980.Google Scholar
- Victor Neumann-Lara. On clique-divergent graphs. In Problèmes Combinatoires et Thèorie des Graphes, number 260 in Colloques Internationaux C.N.R.S., pages 313–315, 1978.Google Scholar
- Erich Prisner. Graph Dynamics. Number 338 in Pitman Research Notes in Mathematics. Longman, 1995.Google Scholar