Distance-critical and distance-redundant graphs
Combinatorics
2024-03-26 v1
Abstract
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\H{o}s and Howorka).
Cite
@article{arxiv.2403.16197,
title = {Distance-critical and distance-redundant graphs},
author = {Andrew Steane},
journal= {arXiv preprint arXiv:2403.16197},
year = {2024}
}
Comments
16 pages, 16 figures, 4 tables