Abstract
We consider the problem of deciding whether a given graph G has an automorphism which moves at least k vertices (where k is a function of ∣ V(G) ∣), a question originally posed by Lubiw (1981). Here we show that this problem is equivalent to the one of deciding whether a graph has a nontrivial automorphism, for k ∈ O(logn / loglogn ).
It is commonly believed that deciding isomorphism between two graphs is strictly harder than deciding whether a graph has a nontrivial automorphism. Indeed, we show that an isomorphism oracle would improve the above result slightly–using such an oracle, one can decide whether there is an automorphism which moves at least k′ vertices, where k′ ∈ O(logn).
If P \(\ne\) NP and Graph Isomorphism is not NP-complete, the above results are fairly tight, since it is known that deciding if there is an automorphism which moves at least n ε vertices, for any fixed ε ∈ (0, 1) , is NP-complete. In other words, a substantial improvement of our result would settle some fundamental open problems about Graph Isomorphism.
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
Agrawal, M., Arvind, V.: A note on decision versus search for graph isomorphism. Information and Computation 131(2), 179–189 (1996)
Arvind, V., Beigel, R., Lozano, A.: The complexity of modular graph automorphism. In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol. 1373, pp. 172–182. Springer, Heidelberg (1998)
Blum, M., Kannan, S.: Designing programs that check their work. Journal of the ACM 43, 269–291 (1995)
Dixon, J.D., Mortimer, B.: Permutation Groups. Springer, New York (1991)
Hoffmann, C.: Group-Theoretic Algorithms and Graph Isomorphism. In: Hoffmann, C.M. (ed.) Group-Theoretic Algorithms and Graph Isomorphism. LNCS, vol. 136. Springer, Heidelberg (1982)
Köbler, J., Schöning, U., Torán, J.: The graph isomorphism problem: its structural complexity. Birkhäuser, Boston (1993)
Ladner, R.: On the structure of polynomial-time reducibilities. Journal of the Assoc. Comput. Mach. 22, 155–171 (1975)
Lozano, A., Torán, J.: On the nonuniform complexity of the graph isomorphism problem. In: Proceedings of the 7th Structure in Complexity Theory Conference, pp. 118–129 (1992)
Lubiw, A.: Some NP-complete problems similar to graph isomorphism. SIAM Journal of Computing 10(1), 11–21 (1981)
Luks, E.: Isomorphism of graphs of bounded valence can be tested in polynomial time. J. Comput. System Sci. 25, 42–65 (1982)
Mathon, R.: A note on the graph isomorphism counting problem. Information Processing Letters 8, 131–132 (1979)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lozano, A., Raghavan, V. (1998). On the Complexity of Counting the Number of Vertices Moved by Graph Automorphisms. In: Arvind, V., Ramanujam, S. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1998. Lecture Notes in Computer Science, vol 1530. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-49382-2_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-49382-2_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65384-4
Online ISBN: 978-3-540-49382-2
eBook Packages: Springer Book Archive