On the SIG-dimension of trees under the L_-metric
From MaRDI portal
Publication:354411
DOI10.1007/S00373-012-1160-4zbMATH Open1268.05136arXiv0910.5380OpenAlexW2079653718MaRDI QIDQ354411FDOQ354411
Authors: L. Sunil Chandran, Rajesh Chitnis, Ramanjit Kumar
Publication date: 19 July 2013
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Abstract: We study the dimension of trees under metric and answer an open problem posed by Michael and Quint (Discrete Applied Mathematics: 127, pages 447-460, 2003). Let be a tree with atleast two vertices. For each , let leaf-degree denote the number of neighbours of that are leaves. We define the maximum leaf-degree as leaf-degree. Let leaf-degree. If , we define . Otherwise define . We show that for a tree , where , provided is not of the form , for some positive integer . If , then . We show that both values are possible.
Full work available at URL: https://arxiv.org/abs/0910.5380
Recommendations
Cites Work
Cited In (2)
This page was built for publication: On the \(SIG\)-dimension of trees under the \(L_\infty\)-metric
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q354411)