Name
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. |
Year | Venue | Field |
|---|---|---|
2013 | CoRR | Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Tree structure,Constructive algorithms,Mathematics |
DocType | Volume | Citations |
Journal | abs/1305.4711 | 0 |
PageRank | References | Authors |
0.34 | 6 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yu Yang | 1 | 18 | 3.42 |
| Deqiang Wang | 2 | 1 | 1.36 |
| Hua Wang | 3 | 130 | 24.62 |
| Hongbo Liu | 4 | 1426 | 105.95 |