Different central parts of trees and their pairwise distances
Combinatorics
2020-04-07 v1
Abstract
We determine the tree which maximizes the distance between characteristic set and subtree core over all trees on vertices. The asymptotic nature of this distance is also discussed. The problem of extremizing the distance between different central parts of trees on vertices with fixed diameter is studied
Keywords
Cite
@article{arxiv.2004.02197,
title = {Different central parts of trees and their pairwise distances},
author = {Dinesh Pandey and Kamal Lochan Patra},
journal= {arXiv preprint arXiv:2004.02197},
year = {2020}
}
Comments
11 pages, 2 figures