Strong edge geodetic problem on grids

DOI10.1007/s40840-021-01137-4zbMath1476.05046arXiv2101.09259OpenAlexW3165316363MaRDI QIDQ2239003

Eva Zmazek

Publication date: 2 November 2021

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/2101.09259

zbMATH Keywords

strong geodetic problemCartesian product of pathsstrong edge geodetic problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) 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 (1)

On the approximation hardness of geodetic set and its variants

Cites Work

• Strong geodetic problem in grid-like architectures
• The geodetic number of a graph
• Strong geodetic number of complete bipartite graphs and of graphs with specified diameter
• Strong geodetic number of graphs and connectivity
• Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes
• An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs
• Strong geodetic problem in networks
• Strong geodetic cores and Cartesian product graphs
• Strong edge geodetic problem in networks
• Strong geodetic problem on Cartesian products of graphs
• Strong geodetic problem on complete multipartite graphs
• Edge geodetic number of a graph

This page was built for publication: Strong edge geodetic problem on grids