Strong edge geodetic problem in networks

DOI10.1515/math-2017-0101zbMath1375.05074OpenAlexW2761247186MaRDI QIDQ2409583

Elizabeth Thomas, Sandi Klavžar, Antony Xavier, Andrew Arokiaraj, Paul D. Manuel

Publication date: 12 October 2017

Published in: Open Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/math-2017-0101

zbMATH Keywords

computational complexitytransport networksgeodetic problemstrong edge geodetic problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)

Related Items

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 ⋮ Monitoring edge-geodetic sets: hardness and graph products ⋮ Monitoring edge-geodetic sets in graphs ⋮ On the distance-edge-monitoring numbers of graphs ⋮ On the approximation hardness of geodetic set and its variants ⋮ Monitoring the edges of a graph using distances ⋮ Strong edge geodetic problem on grids ⋮ Strong geodetic number of graphs and connectivity ⋮ Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes ⋮ Strong geodetic problem in grid-like architectures ⋮ Strong geodetic problem in networks ⋮ Strong geodetic cores and Cartesian product graphs ⋮ Unnamed Item ⋮ On the isometric path partition problem ⋮ Strong geodetic problem on complete multipartite graphs ⋮ Geodetic number of powers of cycles ⋮ An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs

Cites Work

• Sum-paintability of generalized theta-graphs
• Some remarks on the geodetic number of a graph
• On the geodetic number and related metric sets in Cartesian product graphs
• Geodetic sets and Steiner sets in graphs
• The geodetic number of a graph
• Glued trees algorithm under phase damping
• The 2-edge geodetic number and graph operations
• The restrained geodetic number of a graph
• Isometric path numbers of graphs
• On the geodetic number of a graph
• An analytical study of quantum walk through glued-tree graphs
• Exponential algorithmic speedup by a quantum walk
• Geodetic sets in graphs
• Stable networks and product graphs
• Edge geodetic number of a graph
• The edge geodetic number and Cartesian product of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Strong edge geodetic problem in networks