Constructing cospectral vertices through orbits of subgraphs
From MaRDI portal
Cites work
- Characterizing cospectral vertices via isospectral reduction
- Cospectrality preserving graph modifications and eigenvector properties via walk equivalence of vertices
- Finding hidden structures, hierarchies, and cores in networks via isospectral reduction
- Hidden symmetries in real and theoretical networks
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 3411062 (Why is no real title available?)
- Isospectral transformations. A new approach to analyzing multidimensional systems and networks
- Large sets of strongly cospectral vertices in Cayley graphs
- Spectrally extremal vertices, strong cospectrality, and state transfer
- Strongly cospectral vertices
- Strongly cospectral vertices in normal Cayley graphs
- Which cospectral graphs have same degree sequences
This page was built for publication: Constructing cospectral vertices through orbits of subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7391611)