Non-isomorphic graphs with cospectral symmetric powers
The electronic journal of combinatorics, Tome 16 (2009) no. 1
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.
@article{10_37236_209,
author = {Amir Rahnamai Barghi and Ilya Ponomarenko},
title = {Non-isomorphic graphs with cospectral symmetric powers},
journal = {The electronic journal of combinatorics},
year = {2009},
volume = {16},
number = {1},
doi = {10.37236/209},
zbl = {1188.05084},
url = {http://geodesic.mathdoc.fr/articles/10.37236/209/}
}
Amir Rahnamai Barghi; Ilya Ponomarenko. Non-isomorphic graphs with cospectral symmetric powers. The electronic journal of combinatorics, Tome 16 (2009) no. 1. doi: 10.37236/209
Cité par Sources :