A construction of cospectral graphs for the normalized Laplacian
Add this Pith Number to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{BMYUBSZV}
Prints a linked pith:BMYUBSZV badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original abstract
We give a method to construct cospectral graphs for the normalized Laplacian by a local modification in some graphs with special structure. Namely, under some simple assumptions, we can replace a small bipartite graph with a cospectral mate without changing the spectrum of the entire graph. We also consider a related result for swapping out biregular bipartite graphs for the matrix $A+tD$. We produce (exponentially) large families of non-bipartite, non-regular graphs which are mutually cospectral, and also give an example of a graph which is cospectral with its complement but is not self-complementary.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
SEER: Spectral Entropy Encoding of Roles for Context-Aware Attention-Based Design Pattern Detection
SEER adds spectral-entropy role encoding from Laplacian spectra and empirically calibrated time-weighted calling contexts to raise macro-F1 from 92.47% to 93.20% and accuracy from 92.52% to 93.98% on PyDesignNet for 2...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.