On vertices contained in all or in no metric basis

DOI10.1016/j.dam.2021.12.004zbMath1494.05035arXiv2103.08911OpenAlexW4205196632MaRDI QIDQ2161262

Ville Junnila, Tero Laihonen, Anni Hakanen, Ismael González Yero

Publication date: 4 August 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2103.08911

zbMATH Keywords

NP-hardnessunicyclic graphresolving setmetric dimensionmetric basispendantcut-vertexforced vertex

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12)

Related Items (1)

Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the metric dimension of a graph from primary subgraphs
• Metric dimension and pattern avoidance in graphs
• On \(k\)-dimensional graphs and their bases
• Resolvability in graphs and the metric dimension of a graph
• On the number of vertices belonging to all maximum stable sets of a graph
• Vertices contained in all or in no minimum total dominating set of a tree
• Bounds on metric dimensions of graphs with edge disjoint cycles
• Alternative parameterizations of \textsc{Metric Dimension}
• The solid-metric dimension
• Extremal graph theory for metric dimension and diameter
• On the metric dimension of Cartesian powers of a graph
• Landmarks in graphs
• Vertices Belonging to All or to No Maximum Stable Sets of a Graph
• A new graph product and its spectrum
• Vertices contained in every minimum dominating set of a tree
• Resolvability of Hamming Graphs

This page was built for publication: On vertices contained in all or in no metric basis