Trees with unique least central subtrees
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3697163 (Why is no real title available?)
- scientific article; zbMATH DE number 1394673 (Why is no real title available?)
- scientific article; zbMATH DE number 3342032 (Why is no real title available?)
- A self-stabilizing algorithm for finding weighted centroid in trees
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- An Overview of Representative Problems in Location Research
- Centroids to centers in trees
- Graph theory
- Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
- Least central subtrees, center, and centroid of a tree
- Metric Ternary Distributive Semi-Lattices
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
- The subtree center of a tree
- \((r,p)\)-centroid problems on paths and trees
Cited in
(6)- Eccentricity in the joinsemilattice graph of subtrees
- The \(w\)-centroids and least \(w\)-central subtrees in weighted trees
- Some remarks on centrality in the subtree graph of a tree
- Some structural properties of a least central subtree of a tree
- The subtree center of a tree
- Least central subtrees, center, and centroid of a tree
This page was built for publication: Trees with unique least central subtrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1649916)
