Strong geodetic problem in grid-like architectures

DOI10.1007/s40840-018-0609-xzbMath1393.05098arXiv1708.03869OpenAlexW2746832592MaRDI QIDQ723639

Sandi Klavžar, Paul D. Manuel

Publication date: 24 July 2018

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

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

zbMATH Keywords

gridscylindersCartesian product of graphsgeodetic problemstrong geodetic problem

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph operations (line graphs, products, etc.) (05C76)

Related Items (10)

Strong geodetic number of complete bipartite graphs and of graphs with specified diameter ⋮ STRONG DOUBLY GEODETIC PROBLEM ON GRAPHS ⋮ STRONG k-GEODETIC PROBLEM IN GRAPHS: COMPUTATIONAL COMPLEXITY AND SOME RESULTS ⋮ Strong geodetic problem on Cartesian products of graphs ⋮ On the approximation hardness of geodetic set and its variants ⋮ 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
• On the geodetic and the hull numbers in strong product graphs
• Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs
• On the geodetic number and related metric sets in Cartesian product graphs
• The geodetic number of a graph
• On the Steiner, geodetic and hull numbers of graphs
• Products of geodesic graphs and the geodetic number of products
• The geodetic number of the lexicographic product of graphs
• Strong edge geodetic problem in networks
• Isometric path numbers of graphs
• Geodesic Convexity in Graphs
• Computing Minimum Geodetic Sets of Proper Interval Graphs
• Block decomposition approach to compute a minimum geodetic set
• Geodetic Sets in Graphs
• Analogies between the geodetic number and the Steiner number of some classes of graphs
• The Steiner number of a graph

This page was built for publication: Strong geodetic problem in grid-like architectures