Strongly Cospectral Vertices
Abstract
Two vertices and in a graph are cospectral if the vertex-deleted subgraphs and have the same characteristic polynomial. In this paper we investigate a strengthening of this relation on vertices, that arises in investigations of continuous quantum walks. Suppose the vectors for in are the standard basis for . We say that and are strongly cospectral if, for each eigenspace of , the orthogonal projections of and are either equal or differ only in sign. We develop the basic theory of this concept and provide constructions of graphs with pairs of strongly cospectral vertices. Given a continuous quantum walk on on a graph, each vertex determines a curve in complex projective space. We derive results that show tht the closer these curves are, the more "similar" the corresponding vertices are.
Cite
@article{arxiv.1709.07975,
title = {Strongly Cospectral Vertices},
author = {Chris Godsil and Jamie Smith},
journal= {arXiv preprint arXiv:1709.07975},
year = {2017}
}
Comments
30 pages