On Steinerberger Curvature and Graph Distance Matrices
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2023
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866908347666530304 |
|---|---|
| author | Chen, Wei-Chia Tsui, Mao-Pei |
| author_facet | Chen, Wei-Chia Tsui, Mao-Pei |
| contents | Steinerberger proposed a notion of curvature on graphs involving the graph distance matrix (J. Graph Theory, 2023). We show that nonnegative curvature is almost preserved under three graph operations. We characterize the distance matrix and its null space after adding an edge between two graphs. Let $D$ be the graph distance matrix and $\mathbf{1}$ be the all-one vector. We provide a way to construct graphs so that the linear system $Dx = \mathbf{1}$ does not have a solution. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2309_16156 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | On Steinerberger Curvature and Graph Distance Matrices Chen, Wei-Chia Tsui, Mao-Pei Combinatorics Differential Geometry 05C12, 05C50 Steinerberger proposed a notion of curvature on graphs involving the graph distance matrix (J. Graph Theory, 2023). We show that nonnegative curvature is almost preserved under three graph operations. We characterize the distance matrix and its null space after adding an edge between two graphs. Let $D$ be the graph distance matrix and $\mathbf{1}$ be the all-one vector. We provide a way to construct graphs so that the linear system $Dx = \mathbf{1}$ does not have a solution. |
| title | On Steinerberger Curvature and Graph Distance Matrices |
| topic | Combinatorics Differential Geometry 05C12, 05C50 |
| url | https://arxiv.org/abs/2309.16156 |