Generalized centrality in trees
2006-04-18
Research Paper
This publication is part of collection
| Related Files |
|---|
View PDF Version
(ei2006-16.pdf, 0.2MB) |
In 1982, Slater defined path subgraph analogues to the center, median, and (branch or branchweight) centroid of a tree. We define three families of central substructures of trees, including three types of central subtrees of degree at most D that yield the center, median, and centroid for D = 0 and Slater's path analogues for D = 2. We generalize these results concerning paths and include proofs that each type of generalized center and generalized centroid is unique. We also present algorithms for finding one or all generalized central substructures of each type.
Automatically Extracted Terms
- center
- subtree
- vertex
- vertice
- centroid
- algorithm
- class
- median
- caterpillar
- order
- eccentricity
- status
- tree g
- xk ni
- graph
- degree
- definition
- proof
- time algorithms
- caterpillar center
