On the geodesic identification of vertices in convex plane graphs

DOI10.1155/2020/7483291MaRDI QIDQ2217853zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 14 January 2021

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2020/7483291

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• On the strong metric dimension of some related wheel graph
• scientific article; zbMATH DE number 4208114
• The geodetic number of strong product graphs
• The geodesic-transversal problem
• The geodetic numbers of Cartesian products of trees

Cites work

• scientific article; zbMATH DE number 3494441 (Why is no real title available?)
• scientific article; zbMATH DE number 3544092 (Why is no real title available?)
• scientific article; zbMATH DE number 2197925 (Why is no real title available?)
• A Combinatory Detection Problem
• Closed formulae for the strong metric dimension of lexicographic product graphs
• Computing strong metric dimension of some special classes of graphs by genetic algorithms
• Landmarks in graphs
• Mastermind
• Minimal doubly resolving sets and the strong metric dimension of Hamming graphs
• Minimal doubly resolving sets and the strong metric dimension of some convex polytopes
• Minimum fault-tolerant, local and strong metric dimension of graphs.
• Mixed metric dimension of graphs
• On Metric Generators of Graphs
• On families of convex polytopes with constant metric dimension
• On metric dimension of convex polytopes with pendant edges.
• On optimal approximability results for computing the strong metric dimension
• On strong metric dimension of graphs and their complements
• On the Metric Dimension of Cartesian Products of Graphs
• On the Strong Metric Dimension of Cartesian Sum Graphs
• On the fractional strong metric dimension of graphs
• On the strong metric dimension of Cartesian and direct products of graphs
• On the strong metric dimension of corona product graphs and join graphs
• On the strong metric dimension of some related wheel graph
• On the strong metric dimension of the strong products of graphs
• Resolvability in graphs and the metric dimension of a graph
• Resolving domination in graphs
• Simultaneous resolvability in graph families
• Strong metric dimension of rooted product graphs
• Strong metric dimension: a survey
• Strong resolving graphs: the realization and the characterization problems
• The (weighted) metric dimension of graphs: hard and easy cases
• The fractional metric dimension of graphs
• The fractional strong metric dimension in three graph products
• The fractional strong metric dimension of graphs
• The independent resolving number of a graph
• The local metric dimension of a graph
• The solid-metric dimension
• The strong dimension of distance-hereditary graphs
• The strong metric dimension of generalized Sierpiński graphs with pendant vertices
• The strong metric dimension of graphs and digraphs
• The strong metric dimension of the power graph of a finite group
• Variable neighborhood search for the strong metric dimension problem

This page was built for publication: On the geodesic identification of vertices in convex plane graphs

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