English

Strongly Cospectral Vertices

Combinatorics 2017-09-26 v1

Abstract

Two vertices aa and bb in a graph XX are cospectral if the vertex-deleted subgraphs XaX\setminus a and XbX\setminus b 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 eae_a for aa in V(X)V(X) are the standard basis for RV(X)\mathbb{R}^{V(X)}. We say that aa and bb are strongly cospectral if, for each eigenspace UU of A(X)A(X), the orthogonal projections of eae_a and ebe_b 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.

Keywords

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

R2 v1 2026-06-22T21:52:28.876Z