Author:
Barghi Amir Rahnamai,Ponomarenko Ilya
Abstract
The symmetric $m$-th power of a graph is the graph whose vertices are $m$-subsets of vertices and in which two $m$-subsets are adjacent if and only if their symmetric difference is an edge of the original graph. It was conjectured that there exists a fixed $m$ such that any two graphs are isomorphic if and only if their $m$-th symmetric powers are cospectral. In this paper we show that given a positive integer $m$ there exist infinitely many pairs of non-isomorphic graphs with cospectral $m$-th symmetric powers. Our construction is based on theory of multidimensional extensions of coherent configurations.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. The automorphism groups of some token graphs;Proyecciones (Antofagasta);2023-12-01
2. The Edge-Connectivity of Token Graphs;Graphs and Combinatorics;2021-03-25
3. Nonlocal games and quantum permutation groups;Journal of Functional Analysis;2020-09
4. Descriptive complexity of graph spectra;Annals of Pure and Applied Logic;2019-09
5. The Connectivity of Token Graphs;Graphs and Combinatorics;2018-06-19