Complements of coalescing sets
Combinatorics
2022-09-09 v1
Abstract
We consider matrices of the form , with being the diagonal matrix of degrees, being the adjacency matrix, and a fixed value. Given a graph and , which we call a coalescent pair , we derive a formula for the characteristic polynomial where a copy of same rooted graph is attached by the root to \emph{each} vertex of . Moreover, we establish if and are two coalescent pairs which are cospectral for any possible rooted graph , then and will also always be cospectral for any possible rooted graph .
Cite
@article{arxiv.2209.03492,
title = {Complements of coalescing sets},
author = {Steve Butler and Elena D'Avanzo and Rachel Heikkinen and Joel Jeffries and Alyssa Kruczek and Harper Niergarth},
journal= {arXiv preprint arXiv:2209.03492},
year = {2022}
}
Comments
16 pages