Closed formulae for the strong metric dimension of lexicographic product graphs
Work
Year: 2016
Type: article
Abstract: Given a connected graph G, a vertex w ∈ V (G) strongly resolves two vertices u, v ∈ V (G) if there exists some shortest uw path containing v or some shortest vw path containing u.A set S of vertices i... more
Institutions Universidad Rovira i Virgili, Universidad de Cádiz
Cites: 14
Cited by: 18
Related to: 10
FWCI: 1.583
Citation percentile (by year/subfield): 83.14
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond