Strong geodetic problem on Cartesian products of graphs

DOI10.1051/ro/2018003zbMath1392.05033arXiv1708.02414OpenAlexW2963699455MaRDI QIDQ4579894

Vesna Iršič, Sandi Klavžar

Publication date: 10 August 2018

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.02414

zbMATH Keywords

Cartesian productsubgraphgeodetic problemstrong geodetic problemisometric path problem

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)

Related Items

STRONG DOUBLY GEODETIC PROBLEM ON GRAPHS, STRONG k-GEODETIC PROBLEM IN GRAPHS: COMPUTATIONAL COMPLEXITY AND SOME RESULTS, Strong edge geodetic problem on grids, Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes, Strong geodetic cores and Cartesian product graphs, Strong geodetic problem on complete multipartite graphs, An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong geodetic problem in grid-like architectures
• Geodetic contraction games on graphs
• The geodetic number of a graph
• Strong geodetic number of complete bipartite graphs and of graphs with specified diameter
• Products of geodesic graphs and the geodetic number of products
• Strong edge geodetic problem in networks
• The geodetic numbers of graphs and digraphs
• Isometric path numbers of graphs
• Geodetic Number versus Hull Number in $P_3$-Convexity
• Geodesic Convexity in Graphs
• Block decomposition approach to compute a minimum geodetic set
• Geodetic Sets in Graphs
• Extreme Geodesic Graphs
• Graphs with large geodetic number