The geodesic transversal problem on some networks
Combinatorics
2022-12-06 v2
Abstract
A set S of vertices of a graph G is a geodesic transversal of G if every maximal geodesic of G contains at least one vertex of S. We determine a smallest geodesic transversal in certain interconnection networks such as mesh of trees, and some well-known chemical structures such as silicate networks and carbon nanosheets. Some useful general bounds for the corresponding graph invariant are obtained along the way.
Cite
@article{arxiv.2109.09372,
title = {The geodesic transversal problem on some networks},
author = {Paul Manuel and Bostjan Bresar and Sandi Klavzar},
journal= {arXiv preprint arXiv:2109.09372},
year = {2022}
}
Comments
12 Pages and 9 Figures