Strong Cospectrality and Twin Vertices in Weighted Graphs
Abstract: We explore algebraic and spectral properties of weighted graphs containing twin vertices that are useful in quantum state transfer. We extend the notion of adjacency strong cospectrality to arbitrary Hermitian matrices, with focus on the generalized adjacency matrix and the generalized normalized adjacency matrix. We then determine necessary and sufficient conditions such that a pair of twin vertices in a weighted graph exhibits strong cospectrality with respect to the above-mentioned matrices. We also generalize known results about equitable and almost equitable partitions, and use these to determine which joins of the form $X\vee H$, where $X$ is either the complete or empty graph, exhibit strong cospectrality.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.