arXiv (All)
open access
The effect of edge deletion on noncommutative distances on graphs
For a Dirac operator $D$ on a finite weighted graph, let $d^D$ denote the associated noncommutative (Connes) distance. We show that deleting an edge can actually decrease the noncommutative distance between two vertices in the graph. The smallest example of this phenomenon comes from a weighted 4-cy
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
- Compressed commuting graphs of matrix rings#999142
- On the zero ring index of some classes of graphs#293897
- 123-Avoiding permutations with an adjacency constraint#1186840
- Equivalence between spectral properties of graphs with and without loops#1122392
- Perron similarities and the nonnegative inverse eigenvalue problem#609751
Record · ID 1217093
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