Closed formulae for the strong metric dimension of lexicographic product graphs

preprint2014arXivOpen access

Abstract

Given a connected graph GG, a vertex w∈V(G)w\in V(G) strongly resolves two vertices u,v∈V(G)u,v\in V(G) if there exists some shortest u−wu-w path containing vv or some shortest v−wv-w path containing uu. A set SS of vertices is a strong metric generator for GG if every pair of vertices of GG is strongly resolved by some vertex of SS. The smallest cardinality of a strong metric generator for GG is called the strong metric dimension of GG. In this paper we obtain several relationships between the strong metric dimension of the lexicographic product of graphs and the strong metric dimension of its factor graphs.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.