Centroidal bases in graphs
From MaRDI portal
Publication:4642472
DOI10.1002/net.21560zbMath1386.05046arXiv1406.7490OpenAlexW2164538103MaRDI QIDQ4642472
Florent Foucaud, Ralf Klasing, Peter J. Slater
Publication date: 23 May 2018
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.7490
Analysis of algorithms and problem complexity (68Q25) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (7)
Fault tolerant detectors for distinguishing sets in graphs ⋮ Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters ⋮ On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results ⋮ Edge and pair queries-random graphs and complexity ⋮ Centroidal localization game ⋮ Sequential metric dimension ⋮ Open-independent, open-locating-dominating sets
This page was built for publication: Centroidal bases in graphs
