Spectra of symmetric powers of graphs and the Weisfeiler-Lehman refinements

Details Spectra of symmetric powers of graphs and the Weisfeiler-Lehman refinements Spectra of symmetric powers of graphs and the Weisfeiler-Lehman refinements

2008-01-15

arxiv.org/abs/0801.2322v1

Mathematics

Spectral Theory

14 pages

Scientific paper

The k-th power of a n-vertex graph X is the iterated cartesian product of X with itself. The k-th symmetric power of X is the quotient graph of certain subgraph of its k-th power by the natural action of the symmetric group. It is natural to ask if the spectrum of the k-th power --or the spectrum of the k-th symmetric power-- is a complete graph invariant for small values of k, for example, for k=O(1) or k=O(log n). In this paper, we answer this question in the negative: we prove that if the well known 2k-dimensional Weisfeiler-Lehman method fails to distinguish two given graphs, then their k-th powers --and their k-th symmetric powers-- are cospectral. As it is well known, there are pairs of non-isomorphic n-vertex graphs which are not distinguished by the k-dim WL method, even for k=Omega(n). In particular, this shows that for each k, there are pairs of non-isomorphic n-vertex graphs with cospectral k-th (symmetric) powers.

Affiliated with

Also associated with

No associations

Rating

Spectra of symmetric powers of graphs and the Weisfeiler-Lehman refinements does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Spectra of symmetric powers of graphs and the Weisfeiler-Lehman refinements, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Spectra of symmetric powers of graphs and the Weisfeiler-Lehman refinements will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-151260