The effect of edge deletion on noncommutative distances on graphs
Abstract
For a Dirac operator D on a finite weighted graph, let dD 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-cycle, and the case of deleting an edge from a weighted 4-cycle is determined completely: if dD' denotes the noncommutative distance in the graph after edge deletion, we prove that sup dD/dD' = 2/√3 for the $4$-cycle, and further that this upper bound holds for all graphs. On the other hand, we show that deleting an edge can decrease the noncommutative distance between two vertices of an n-cycle precisely when n is divisible by $4$. In cases when a deleted edge decreases the noncommutative distance between two vertices x and y, we show that the deleted edge need not be incident to either of the vertices x or y, and in fact the deleted edge can be arbitrarily far from both in the graph-theoretic (number of edges) distance and in the weighted (geodesic) distance. Moreover, deletion of a single vertex arbitrarily far from both x and y in either the graph-theoretic or weighted distance can change dD(x,y) by an arbitrarily large factor.
Related
- From Wheel to Jahangir graphs: spectra and energy under structured edge deletion
- Claw-Free and Line Graph Edge Deletion on Block Graphs
- On Cayley Graphs of Skew Braces and Their Distances
- NP-Hardness of the H-Free Edge-Deletion Problem
- Smooth Isotropic Covariance Functions on Metric Graphs via Polyharmonic Resistance Distances
BibTeX
@misc{swartz2026effect,
title = {{The effect of edge deletion on noncommutative distances on graphs}},
author = {Eric Swartz},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.07718},
eprint = {2610.07718},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.07718},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - The effect of edge deletion on noncommutative distances on graphs
AU - Eric Swartz
PY - 2026
DA - 2026/10/06
PB - arXiv
DO - 10.48550/arxiv.2610.07718
UR - https://arxiv.org/abs/2610.07718
AB - 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-cycle, and the case of deleting an edge from a weighted 4-cycle is determined completely: if d^D' denotes the noncommutative distance in the graph after edge deletion, we prove that sup d^D/d^D' = 2/√3 for the $4$-cycle, and further that this upper bound holds for all graphs. On the other hand, we show that deleting an edge can decrease the noncommutative distance between two vertices of an n-cycle precisely when n is divisible by $4$. In cases when a deleted edge decreases the noncommutative distance between two vertices x and y, we show that the deleted edge need not be incident to either of the vertices x or y, and in fact the deleted edge can be arbitrarily far from both in the graph-theoretic (number of edges) distance and in the weighted (geodesic) distance. Moreover, deletion of a single vertex arbitrarily far from both x and y in either the graph-theoretic or weighted distance can change d^D(x,y) by an arbitrarily large factor.
ER -