Abstract
Using Delsarte, Goethals and Seidel’s fundamental theorem of spherical codes and designs, we investigate the complexity of graph-isomorphism testing. We derive a set of basic conditions under which testing isomorphism of graphs of bounded eigenvalue multiplicity is immediately reducible to testing isomorphism of graphs of bounded color multiplicity.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Arvind, V., Das, B., Köbler, J., Toda, S.: Colored hypergraph isomorphism is fixed parameter tractable. Algorithmica 71, 120–138 (2015)
Babai, L.: Monte carlo algorithms in graph isomorphism testing. Technical Report 79–10, Départment de mathématiques et de statistique, Université de Montréal, Montréal (1979)
Babai, L., Grigoryev, Yu, D., Mount, D.M.: Isomorphism of graphs with bounded eigenvalue multiplicity. In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, San Francisco, 5–7 May 1982, pp. 310–324. ACM, New York (1982)
Bannai, E., Bannai, E.: A survey on spherical designs and algebraic combinatorics on spheres. Eur. J. Combin. 30, 1392–1425 (2009)
Biggs, N.: Algebraic Graph Theory. Cambridge Mathematical Library. Cambridge University Press, Cambridge (1993)
Cameron, P.J.: Finite permutation groups and finite simple groups. Bull. Lond. Math. Soc. 13, 1–22 (1981)
Delsarte, P., Goethals, J.M., Seidel, J.J.: Spherical codes and designs. Geom. Dedicata 6, 363–388 (1977)
Evdokimov, S., Ponomarenko, I.: Isomorphism of coloured graphs with slowly increasing multiplicity of jordan blocks. Combinatorica 19, 321–333 (1999)
Furst, M., Hopcroft, J., Luks, E.: A subexponential algorithm for trivalent graph isomorphism. Technical Report 80–426, Department of Computer Science, Cornell University, Ithaca, NY (1980)
Acknowledgement
The author takes pleasure in acknowledging the hospitality of Nihon University while this research was being undertaken. He would like to especially thank Seinosuke Toda for hosting the author, bringing the author’s attention to this topic and stimulating conversations. The author would also like to acknowledge Kazuhiro Yokoyama for insightful comments.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Miyazaki, T. (2017). On Testing Isomorphism of Graphs of Bounded Eigenvalue Multiplicity. In: Blömer, J., Kotsireas, I., Kutsia, T., Simos, D. (eds) Mathematical Aspects of Computer and Information Sciences. MACIS 2017. Lecture Notes in Computer Science(), vol 10693. Springer, Cham. https://doi.org/10.1007/978-3-319-72453-9_27
Download citation
DOI: https://doi.org/10.1007/978-3-319-72453-9_27
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-72452-2
Online ISBN: 978-3-319-72453-9
eBook Packages: Computer ScienceComputer Science (R0)