Metric Dimension Parameterized by Max Leaf Number

DOI10.7155/JGAA.00360zbMATH Open1327.05320arXiv1506.01749OpenAlexW3102164014WikidataQ56551552 ScholiaQ56551552MaRDI QIDQ2941747

Author name not available (Why is that?)

Publication date: 25 August 2015

Published in: (Search for Journal in Brave)

Abstract: The metric dimension of a graph is the size of the smallest set of vertices whose distances distinguish all pairs of vertices in the graph. We show that this graph invariant may be calculated by an algorithm whose running time is linear in the input graph size, added to a function of the largest possible number of leaves in a spanning tree of the graph.

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

Mathematics Subject Classification ID

No records found.

This page was built for publication: Metric Dimension Parameterized by Max Leaf Number

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