Geodesic transversal problem for join and lexicographic product of graphs

DOI10.1007/S40314-022-01834-1zbMATH Open1499.05488OpenAlexW4226277296MaRDI QIDQ2140756FDOQ2140756

Authors: Iztok Peterin, Gabriel Semanišin 

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

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

Cites Work

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

Cited In (1)

• The geodesic transversal problem on some networks

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

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