Misc,

The geodesic transversal problem on some networks

, , and .
(2021)cite arxiv:2109.09372Comment: 12 Pages and 9 Figures.

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.

Tags

Users

  • @j.c.m.janssen

Comments and Reviews