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

DOI10.17654/DM023020085zbMath1499.05201OpenAlexW3012856951MaRDI QIDQ5075633

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

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

Mathematics Subject Classification ID

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)

Cites Work

• Strong geodetic problem in grid-like architectures
• A survey of selected recent results on total domination in graphs
• The geodetic number of a graph
• Strong geodetic number of complete bipartite graphs and of graphs with specified diameter
• Strong edge geodetic problem in networks
• On the edge monophonic number of a graph
• On Complexity of Total Vertex Cover on Subcubic Graphs
• Strong geodetic problem on Cartesian products of graphs
• Edge geodetic number of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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