English

Complements of coalescing sets

Combinatorics 2022-09-09 v1

Abstract

We consider matrices of the form qD+AqD+A, with DD being the diagonal matrix of degrees, AA being the adjacency matrix, and qq a fixed value. Given a graph HH and BV(G)B\subseteq V(G), which we call a coalescent pair (H,B)(H,B), we derive a formula for the characteristic polynomial where a copy of same rooted graph GG is attached by the root to \emph{each} vertex of BB. Moreover, we establish if (H1,B1)(H_1,B_1) and (H2,B2)(H_2,B_2) are two coalescent pairs which are cospectral for any possible rooted graph GG, then (H1,V(H1)B1)(H_1,V(H_1)\setminus B_1) and (H2,V(H2)B2)(H_2,V(H_2)\setminus B_2) will also always be cospectral for any possible rooted graph GG.

Keywords

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

R2 v1 2026-06-28T00:55:15.782Z