2013/05/21 by Yu Yang, Deqiang Wang, Yang, Yu +5
Computer Science · Decision Sciences · Mathematics · #68R10 #Advanced Algebra and Logic #Advanced Graph Theory Research #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Fuzzy and Soft Set Theory #G.2.2 #acm:68R10 #cs.DM #math.CO #msc:68R10
paper · pdf · doi:10.48550/arxiv.1305.4711
14 pages, 3 figures
arxiv created 2013/05/21 · openalex publication_date 2013/05/21 · arxiv updated 2013/05/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.