On BC-trees and BC-subtrees
Discrete Mathematics
2013-05-22 v1 Combinatorics
Abstract
A BC-tree (block-cutpoint-tree) is a tree (with at least two vertices) where the distance between any two leaves is even. Motivated from the study of the "core" of a graph, BC-trees provide an interesting class of trees. We consider questions related to BC-trees as an effort to make modest progress towards the understanding of this concept. Constructive algorithms are provided for BC-trees with given order and number of leaves whenever possible. The concept of BC-subtrees is naturally introduced. Inspired by analogous work on trees and subtrees, we also present some extremal results and briefly discuss the "middle part" of a tree with respect to the number of BC-subtrees.
Cite
@article{arxiv.1305.4711,
title = {On BC-trees and BC-subtrees},
author = {Yu Yang and Deqiang Wang and Hua Wang and Hongbo Liu},
journal= {arXiv preprint arXiv:1305.4711},
year = {2013}
}
Comments
14 pages, 3 figures