Distance-critical and distance-redundant graphs
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866929287245856768 |
|---|---|
| author | Steane, Andrew |
| author_facet | Steane, Andrew |
| contents | If a vertex in a graph can be deleted without affecting distances among the other vertices, we shall say it is distance-redundant. Graphs with all, some or no such vertices are discussed. (The latter class was termed distance-critical by Erdős and Howorka). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_16197 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Distance-critical and distance-redundant graphs Steane, Andrew Combinatorics If a vertex in a graph can be deleted without affecting distances among the other vertices, we shall say it is distance-redundant. Graphs with all, some or no such vertices are discussed. (The latter class was termed distance-critical by Erdős and Howorka). |
| title | Distance-critical and distance-redundant graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2403.16197 |