Strong geodetic problem in networks

DOI10.7151/dmgt.2139zbMath1430.05028OpenAlexW2884523098WikidataQ129513385 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

zbMATH Keywords

computational complexitySierpiński graphsgeodetic problemstrong geodetic problemApollonian networks

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) 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)

Related Items (9)

Strong geodetic number of complete bipartite graphs and of graphs with specified diameter ⋮ STRONG DOUBLY GEODETIC PROBLEM ON 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 problem on complete multipartite graphs ⋮ Geodetic number of powers of cycles ⋮ Algorithmic upper bounds for graph geodetic number ⋮ An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs

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

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