Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Metadata
bibkey: monterde2022strongcospectralitytwins
authors: Hermie Monterde
year: 2022
title: "Strong cospectrality and twin vertices in weighted graphs"
doi: 10.13001/ela.2022.6721
url: https://arxiv.org/abs/2111.01265v2
claim: "The paper studies strong cospectrality of vertices with respect to generalized adjacency and normalized adjacency matrices of weighted graphs, relates it to twin vertices, recalls the Arnadottir-Godsil bound |V(X)|/n on pairwise adjacency strongly cospectral vertices of normal Cayley graphs, where n is the largest eigenvalue multiplicity of A, and asks whether this bound holds for other classes of graphs and in general for generalized adjacency matrices."
strata_touched:
  - D5/S3/Quantum/Dynamics/StrongCospectralMultiplicityBoundRefutation
license: citation-only
triage: anchor

Strong cospectrality and twin vertices in weighted graphs

H. Monterde, arXiv:2111.01265v2; The Electronic Journal of Linear Algebra 38 (2022), 494–518. Quotations are from the v2 TeX source.

Generalized adjacency matrices:

Let with . A generalized adjacency matrix of is a matrix of the form

Note that if and , then

Spectral decomposition and strong cospectrality:

Let be an Hermitian matrix. Then and admits a spectral decomposition where the ’s are the distinct eigenvalues of and each is the orthogonal projection matrix onto the eigenspace associated with .

parallel if and are parallel vectors for each , i.e., for each , there exists such that ,

strongly cospectral if for each , (\ref{parallel}) holds for some with .

If is real symmetric, then and are parallel with respect to if the constant in (\ref{parallel}) is real, and strongly cospectral with respect to if for each

The question (Section 3, PDF p. 15 of v2):

We mention an interesting result of Árnadóttir and Godsil which states that if is a normal Cayley graph and is the largest multiplicity of an eigenvalue of , then the number of pairwise adjacency strongly cospectral vertices is bounded above by [4, Theorem 6.1]. It would be interesting to check whether this bound holds for other classes of graphs, and in general whenever .

Verified locator

Source: https://arxiv.org/abs/2111.01265v2

  • URL: https://arxiv.org/abs/2111.01265v2 (the e-print is a tar archive; member ELA-sample1_copy.tex, md5 21a1ee53b9e64ae0b3a6773aa4fdbb45, 1444 lines):
    • generalized adjacency matrices, l. 143–150, and the adjacency special case, l. 161;
    • spectral decomposition, parallelism and strong cospectrality, l. 170–192;
    • the question after Theorem 3.11, l. 727.
  • DOI: 10.13001/ela.2022.6721 (https://doi.org/10.13001/ela.2022.6721; Crossref lists The Electronic Journal of Linear Algebra, pages 494–518, published 10 September 2022, without a volume field; the arXiv journal reference gives volume 38).