Coalescing sets preserving cospectrality of graphs arising from block similarity matrices
arxiv(2024)
摘要
Coalescing involves gluing one or more rooted graphs onto another graph.
Under specific conditions, it is possible to start with cospectral graphs that
are coalesced in similar ways that will result in new cospectral graphs. We
present a sufficient condition for this based on the block structure of
similarity matrices, possibly with additional constraints depending on which
type of matrix is being considered. The matrices considered in this paper
include the adjacency, Laplacian, signless Laplacian, distance, and generalized
distance matrix.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要