Constructing Cospectral Vertices Through Orbits of Subgraphs
Abstract
A constructive method is given for obtaining cospectral vertices in undirected graphs, along with an operation that preserves this construction. We prove that the construction yields cospectral vertices, as well as strongly cospectral vertices under additional conditions. Furthermore, we generalize cospectral vertices to the case of the graph Laplacian and provide an analogous construction.
Fields of Study & Subjects
Graph theory and applications
Limits and Structures in Graph Theory
Graph Labeling and Dimension Problems
Publication details
- Journal / source
- arXiv (Cornell University)
- Publication date
- 6 January 2026
- Document type
- Preprint