Strong geodetic problem in networks
DOI10.7151/dmgt.2139zbMath1430.05028WikidataQ129513385 ScholiaQ129513385MaRDI QIDQ2282484
Andrew Arokiaraj, Elizabeth Thomas, Sandi Klavžar, Antony Xavier, Paul D. Manuel
Publication date: 8 January 2020
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2139
computational complexity; Sierpiński graphs; geodetic problem; strong geodetic problem; Apollonian networks
91D30: Social networks; opinion dynamics
05C82: Small world graphs, complex networks (graph-theoretic aspects)
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C12: Distance in graphs
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey and classification of Sierpiński-type graphs
- Some remarks on the geodetic number of a graph
- On the geodetic and geodetic domination numbers of a graph
- On the geodetic number and related metric sets in Cartesian product graphs
- The hull and geodetic numbers of orientations of graphs
- Geodetic sets and Steiner sets in graphs
- The hull number of a graph
- The geodetic number of a graph
- Geodetic spectra of graphs.
- Strong geodetic number of complete bipartite graphs and of graphs with specified diameter
- Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
- On the Steiner, geodetic and hull numbers of graphs
- The geodetic number of an oriented graph
- Products of geodesic graphs and the geodetic number of products
- Enumeration of labeled geodetic planar graphs
- On generalized Sierpiński graphs
- Strong edge geodetic problem in networks
- The lower and upper forcing geodetic numbers of block--cactus graphs
- The number of spanning trees in Apollonian networks
- On pitfalls in computing the geodetic number of a graph
- Orientable convexity, geodetic and hull numbers in graphs
- On the geodetic number of a graph
- Geodesic Convexity in Graphs
- Computing Minimum Geodetic Sets of Proper Interval Graphs
- The Tower of Hanoi – Myths and Maths
- Geodetic Sets in Graphs
- Enumeration of spanning trees on Apollonian networks
- Tutte polynomial of the Apollonian network
- Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
- Geodetic sets in graphs
- Computational Complexity of Geodetic Set