STRONG k-GEODETIC PROBLEM IN GRAPHS: COMPUTATIONAL COMPLEXITY AND SOME RESULTS

DOI10.17654/DM023020085MaRDI QIDQ5075633zbMATH OpenOpenAlexFDO

Authors D. Antony Xavier, L. G. Bino Infanta, Santiagu Theresal

Publication date 16 May 2022

Published in Advances and Applications in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.17654/dm023020085

zbMATH Keywords

\(k\)-geodetic setgeodetic setstrong \(k\)-geodetic setstrong geodetic set

Mathematics Subject Classification ID

Distance in graphs (05C12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Strong geodetic problem on complete multipartite graphs
• STRONG DOUBLY GEODETIC PROBLEM ON GRAPHS
• An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs
• Hardness and approximation for the geodetic set problem in some graph classes
• scientific article; zbMATH DE number 139911
• Strong geodetic problem on Cartesian products of graphs
• Strong geodetic number of graphs and connectivity
• scientific article; zbMATH DE number 7765365
• An extremal problem in geodetic graphs
• scientific article; zbMATH DE number 5531985

Cites work

• A survey of selected recent results on total domination in graphs
• Edge geodetic number of a graph
• scientific article; zbMATH DE number 5834292 (Why is no real title available?)
• scientific article; zbMATH DE number 6010675 (Why is no real title available?)
• scientific article; zbMATH DE number 1990703 (Why is no real title available?)
• scientific article; zbMATH DE number 2188404 (Why is no real title available?)
• On complexity of total vertex cover on subcubic graphs
• On the edge monophonic number of a graph
• Strong edge geodetic problem in networks
• Strong geodetic number of complete bipartite graphs and of graphs with specified diameter
• Strong geodetic problem in grid-like architectures
• Strong geodetic problem on Cartesian products of graphs
• The geodetic number of a graph

Cited in

(1)

• An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs

This page was built for publication: STRONG k-GEODETIC PROBLEM IN GRAPHS: COMPUTATIONAL COMPLEXITY AND SOME RESULTS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075633)