Strong edge geodetic problem in networks
DOI10.1515/MATH-2017-0101zbMATH Open1375.05074OpenAlexW2761247186MaRDI QIDQ2409583FDOQ2409583
Authors: Sandi Klavžar, Antony Xavier, Andrew Arokiaraj, Elizabeth Thomas, Paul 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
Recommendations
- Strong geodetic problem in networks
- Strong edge geodetic problem on grids
- Strong geodetic problem on complete multipartite graphs
- STRONG DOUBLY GEODETIC PROBLEM ON GRAPHS
- Strongly geodetic graphs
- Strong geodetic problem on Cartesian products of graphs
- scientific article; zbMATH DE number 746082
- Strong geodetic problem in grid-like architectures
- Geodetic bounds in graphs
- scientific article; zbMATH DE number 3455291
Analysis of algorithms and problem complexity (68Q25) Distance in graphs (05C12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Exponential algorithmic speedup by a quantum walk
- Handbook of product graphs
- On the geodetic number of a graph
- Minimum metric dimension of silicate networks.
- Some remarks on the geodetic number of a graph
- The geodetic number of a graph
- Glued trees algorithm under phase damping
- An analytical study of quantum walk through glued-tree graphs
- On the geodetic number and related metric sets in Cartesian product graphs
- Stable networks and product graphs
- Sum-paintability of generalized theta-graphs
- Isometric path numbers of graphs
- Geodetic sets and Steiner sets in graphs
- Geodetic sets in graphs
- Title not available (Why is that?)
- The edge geodetic number and Cartesian product of graphs
- Edge geodetic number of a graph
- The restrained geodetic number of a graph
- Graph covering via shortest paths
- The 2-edge geodetic number and graph operations
Cited In (22)
- Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes
- On graphs coverable by \({k}\) shortest paths
- Strong geodetic cores and Cartesian product graphs
- Geodetic number of powers of cycles
- An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs
- Title not available (Why is that?)
- Strong edge geodetic problem on grids
- Strong geodetic problem in grid-like architectures
- Strong geodetic number of complete bipartite graphs and of graphs with specified diameter
- On the distance-edge-monitoring numbers of graphs
- Strong geodetic problem in networks
- Strong geodetic problem on Cartesian products of graphs
- Strong geodetic problem on complete multipartite graphs
- STRONG DOUBLY GEODETIC PROBLEM ON GRAPHS
- Monitoring edge-geodetic sets: hardness and graph products
- Monitoring edge-geodetic sets in graphs
- On the isometric path partition problem
- STRONG k-GEODETIC PROBLEM IN GRAPHS: COMPUTATIONAL COMPLEXITY AND SOME RESULTS
- Strong geodetic number of graphs and connectivity
- On the approximation hardness of geodetic set and its variants
- Distance-based covering problems for graphs of given cyclomatic number
- Monitoring edge-geodetic sets in graphs: extremal graphs, bounds, complexity
This page was built for publication: Strong edge geodetic problem in networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2409583)
