Geodesic transversal problem for join and lexicographic product of graphs

DOI10.1007/s40314-022-01834-1zbMath1499.05488OpenAlexW4226277296MaRDI QIDQ2140756

Iztok Peterin, Gabriel Semanisin

Publication date: 23 May 2022

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-022-01834-1

zbMATH Keywords

joinlexicographic productgeodesic transversalgeodesic transversal number

Mathematics Subject Classification ID

Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

The geodesic transversal problem on some networks

Cites Work

• Unnamed Item
• Closed formulae for the strong metric dimension of lexicographic product graphs
• On the strong metric dimension of Cartesian and direct products of graphs
• On the roman domination in the lexicographic product of graphs
• The strong metric dimension of graphs and digraphs
• On the strong metric dimension of corona product graphs and join graphs
• \([1,k\)-domination number of lexicographic products of graphs]
• The geodesic-transversal problem
• On the strong metric dimension of the strong products of graphs
• The geodetic number of the lexicographic product of graphs
• Minimum \(k\)-path vertex cover
• Minimal doubly resolving sets and the strong metric dimension of Hamming graphs
• On Metric Generators of Graphs

This page was built for publication: Geodesic transversal problem for join and lexicographic product of graphs