Title: Density, construction, indistinguishable graphs and trees
报告人: 王华教授(Georgia Southern University)
Through studying two questions on average subtree orders, we provide some insights on how `dense' or `sparse' a tree can be in this setting. Some characteristics of the dense and sparse trees will be presented. We also briefly mention results on `indistinguishable' graphs/trees that, among many graph invariants, possess the same subtree polynomials. Students are particularly welcome.
These studies are inspired by Jamison's early papers and are joint work with S. Wagner and A. Vince.
English
官方微信