arXiv (All)
open access
Sedentary quantum walks on bipartite and planar graphs
If a quantum walk starting on a vertex tends to stay at home, then that vertex is said to be sedentary. We prove that almost all planar graphs and almost all trees contain at least two sedentary vertices for any assignment of edge weights --- a result that suggests vertex sedentariness is a common p
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Perfect matching covers of claw-free cubic graphs#1156072
- Sub-quorum colorings of some infinite families of caterpillars#1144586
- Equitable Decompositions: A Gateway to Spectral Theory Through Graph Automorphisms#268172
- Affine and Lattice Structures in Regular $\mathbb{N}$-Graded Vertex Operator Algebras with Gorenstein $V_0$#1037463
- Continuous graph homomorphisms of higher dimensional abelian group actions#1144991
Record · ID 1130503
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive