Cospectral vertices, walk-regular planar graphs and the echolocation problem
From MaRDI portal
Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Global Riemannian geometry, including pinching (53C20)
Cites work
- Automorphismen von polyedrischen Graphen
- Characterizing cospectral vertices via isospectral reduction
- Feasibility conditions for the existence of walk-regular graphs
- scientific article; zbMATH DE number 3685520 (Why is no real title available?)
- scientific article; zbMATH DE number 3411062 (Why is no real title available?)
- Julia: a fresh approach to numerical computing
- Pretty good quantum state transfer in asymmetric graphs via potential
- Quantum fractional revival on graphs
- State transfer on graphs
- Surfaces in which every point sounds the same
This page was built for publication: Cospectral vertices, walk-regular planar graphs and the echolocation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6889797)