Graph automorphisms with maximal projection distances

  • H. N. de Ridder
  • H. L. Bodlaender
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1684)


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.

Unable to display preview. Download preview PDF.


  1. [1]
    Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.Google Scholar
  2. [2]
    M.J. Atallah, D.Z. Chen, and D.T. Lee. An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications. Algorithmica, 14:429–441, 1995.zbMATHCrossRefMathSciNetGoogle Scholar
  3. [3]
    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
  4. [4]
    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
  5. [5]
    Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. The MIT Press, 1990.Google Scholar
  6. [6]
    D.G. Corneil, H. Lerchs, and L. Stewart Burlingham. Complement reducible graphs. Discrete Appl. Math., 3(1):163–174, 1981.zbMATHCrossRefMathSciNetGoogle Scholar
  7. [7]
    D.G. Corneil, Y. Perl, and L. Stewart. Cographs: Recognition, applications and algorithms. Congressus Numerantium, 43:249–258, 1984.MathSciNetGoogle Scholar
  8. [8]
    D.G. Corneil, Y. Perl, and L. K. Stewart. A linear recognition algorithm for cographs. SIAM J. Comput., 14(4):926–934, November 1985.zbMATHCrossRefMathSciNetGoogle Scholar
  9. [9]
    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
  10. [10]
    Martin Charles Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, 1980.Google Scholar
  11. [11]
    Wen-Lian Hsu. O(M·N) algorithms for the recognition and isomorphism problems on circular-arc graphs. SIAM J. Comput., 24(3):411–439, June 1995.zbMATHCrossRefMathSciNetGoogle Scholar
  12. [12]
    Anna Lubiw. Some NP-complete problems similar to graph isomorphism. SIAM J. Comput., 10(1):11–21, February 1981.zbMATHCrossRefMathSciNetGoogle Scholar
  13. [13]
    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
  14. [14]
    Erich Prisner. Graph Dynamics. Number 338 in Pitman Research Notes in Mathematics. Longman, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • H. N. de Ridder
    • 1
  • H. L. Bodlaender
    • 1
  1. 1.Department of Computer ScienceUtrecht UniversityUtrechtthe Netherlands

Personalised recommendations