6,148 research outputs found
Strong geodetic problem on Cartesian products of graphs
The strong geodetic problem is a recent variation of the geodetic problem.
For a graph , its strong geodetic number is the cardinality of
a smallest vertex subset , such that each vertex of lies on a fixed
shortest path between a pair of vertices from . In this paper, the strong
geodetic problem is studied on the Cartesian product of graphs. A general upper
bound for is determined, as well as exact values
for , , and certain prisms.
Connections between the strong geodetic number of a graph and its subgraphs are
also discussed.Comment: 18 pages, 9 figure
Geodetic topological cycles in locally finite graphs
We prove that the topological cycle space C(G) of a locally finite graph G is
generated by its geodetic topological circles. We further show that, although
the finite cycles of G generate C(G), its finite geodetic cycles need not
generate C(G).Comment: 1
- …