On different ``middle parts of a tree

zbMath1393.05081arXiv1701.05215MaRDI QIDQ1658760

Shuai Yuan, László A. Székely, Hua Wang, Heather C. Smith

Publication date: 15 August 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1701.05215

zbMATH Keywords

extremal problemseccentricitygreedy treecometvertex distancesubtree core

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Related Items (4)

Different central parts of trees and their pairwise distances ⋮ On the eccentric subtree number in trees ⋮ Variations of the eccentricity and their properties in trees ⋮ A conjecture on different central parts of binary trees

Cites Work

• Greedy trees, subtrees and antichains
• Binary trees with the largest number of subtrees
• The extremal values of the Wiener index of a tree with given degree sequence
• Extremal values for ratios of distances in trees
• On subtrees of trees
• On the average number of nodes in a subtree of a tree
• Distance in graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: On different ``middle parts of a tree